Skip to main content

Home/ Computer Science Knowledge Sharing/ Group items tagged time

Rss Feed Group items tagged

Janos Haits

Find out where you are on the Cyberthreat map / Узнай, где сейчас кипит кибер... - 0 views

  •  
    "CYBERTHREAT REAL-TIME MAP"
Janos Haits

GraphQL | A query language for your API - 0 views

  •  
    'GraphQL is a query language for APIs and a runtime for fulfilling those queries with your existing data. GraphQL provides a complete and understandable description of the data in your API, gives clients the power to ask for exactly what they need and nothing more, makes it easier to evolve APIs over time, and enables powerful developer tools.'
Janos Haits

Best AI Writer, Content Generator & Copywriting Assistant | Easy-Peasy.AI - 0 views

  •  
    "Why choose one AI tool when you can have them all? MARKY: ChatGPT like AI chat with real-time data, vision, and PDF AI Chat Build no-code AI Bots by training on your own data. Embed on any website or share via URL"
Janos Haits

Elicit: The AI Research Assistant - 0 views

  •  
    "Analyze research papers at superhuman speed Automate time-consuming research tasks like summarizing papers, extracting data, and synthesizing your findings."
Janos Haits

No code browser automation | axiom.ai - 0 views

  •  
    "Browser Automation. Quickly, without code Save time - use browser bots to automate website actions and repetitive tasks on any website or web app."
Janos Haits

Coral AI: Search & Summarize Documents with AI - 0 views

  •  
    "Search & Summarize Documents with AI Cut your reading time in half - upload a PDF to get answers, summaries, translations, and citations in seconds."
Janos Haits

20 Best AI Tools For Researchers and Graduate Students - 0 views

  •  
    "The field of intelligence (AI) is making an impact on academic research. A variety of AI tools are being created to assist researchers in simplifying their work processes and automating tasks. This enables researchers to dedicate time to thinking and analysis."
Janos Haits

Not Diamond - 0 views

  •  
    "The future is multi-model Call the right model at the right time with the world's most powerful AI model router."
Janos Haits

MaxAI.me: 1-Click AI Everywhere (GPT-4, Claude 3, Gemini 1.5) - 0 views

  •  
    "1-click AI anywhere, Less time, Better results. Use personalized 1-click AI anywhere to save hours every day. Powered by ChatGPT, Claude 3, Gemini 1.5, GPT-4, and more."
Janos Haits

Echoes - ChatGPT & Claude Conversation Search and Management - 0 views

  •  
    "Take Control of Your AI Conversations Across ChatGPT, Claude, and Gemini! Search, organize, and summarize your AI interactions seamlessly-all in one powerful tool designed to save you time and boost your productivity."
Janos Haits

Leaderboard | WebDev Arena - 0 views

  •  
    "WebDev Arena Leaderboard WebDev Arena is a real-time AI coding competition where models go head-to-head in web development challenges, developed by LMArena"
Justin Pierce

The Most Excellent Bookkeeping Services - 2 views

When I was still single, I had all the time to manage my gift shop. But when I got married a year ago, I found it really hard to give equal attention to my business as well as to my roles as a wife...

started by Justin Pierce on 02 Oct 12 no follow-up yet
cecilia marie

Best Shield Against Computer Viruses - 1 views

I have always wondered why my files are often corrupted and to think that I have installed an antiVirus software. I always scan my external disks each time I insert them in my unit. It was only lat...

virus protection

started by cecilia marie on 04 Nov 11 no follow-up yet
shalani mujer

Top-Notch Computer Tech Support Service - 1 views

I will always be thankful to ComputerTechSupportService because they always provide top caliber computer support service that you can never find anywhere. They have certified PC technicians wh...

computer support service

started by shalani mujer on 10 Nov 11 no follow-up yet
Islam TeCNo

Deep Blue (chess computer) - Wikipedia, the free encyclopedia - 0 views

  • Deep Blue was a chess-playing computer developed by IBM. On May 11, 1997, the machine won a six-game match by two wins to one with three draws against world champion Garry Kasparov.[1] Kasparov accused IBM of cheating and demanded a rematch, but IBM declined and dismantled Deep Blue.[2] Kasparov had beaten a previous version of Deep Blue in 1996
    • Abdelrahman Ogail
       
      When AI beats humanity!
  • Deep Blue was then heavily upgraded (unofficially nicknamed "Deeper Blue")[11] and played Kasparov again in May 1997, winning the six-game rematch 3½–2½, ending on May 11, finally ending in game six, and becoming the first computer system to defeat a reigning world champion in a match under standard chess tournament time controls.
  • The system derived its playing strength mainly out of brute force computing power.
    • Islam TeCNo
       
      Dah eli bysamoh brute force men no3 el 7aywan :D
Abdelrahman Ogail

Common Mistakes in Online and Real-time Contests - 0 views

  • Dynamic programming problems are to be solved with tabular methods
    • Ahmed Mansour
       
      Dynamic programming, like the divide-and-conquer method, solves problems by combining the solutions to subproblems. ("Programming" in this context refers to a tabular method, not to writing computer code) y3ney 3bara 3n 2nene bn2sem el problem el kbirr le shwit probelsm so3'ira .. we ne solve el problems deh we ngma el yab2a dh 7l lel problem el kbira :D;d see introduction to algorithms book . chapter 15
  • breadth-first search
    • Ahmed Mansour
       
      In graph theory, breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds the goal. ya3ney be el 3arby keda lw ana 3ndy tree maslan we el tree dh bettkwen mn shwit levels 3ady gedan.. lama hagey 23mel search 3la node mo3ina fi el tree deh hamsk el tree mn el root bet3ha ely hwa level 0 we habda2 2mshy level by level y3ney hanzl 3la el level 1 we hakaz le 3'it mal2y el node bet3ty ,,,, see this ,, it's a tutorial show how BFS algorithm is work!! http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/breadthSearch.htm
  • Memorize the value of pi You should always try to remember the value of pi as far as possible, 3.1415926535897932384626433832795, certainly the part in italics. The judges may not give the value in the question, and if you use values like 22/7 or 3.1416 or 3.142857, then it is very likely that some of the critical judge inputs will cause you to get the wrong answer. You can also get the value of pi as a compiler-defined constant or from the following code: Pi=2*acos(0)
    • Islam TeCNo
       
      hhhhhhhhhhh ...... awl mara a3rf el mawdo3 dah we awl mara a3raf en el Pi = 2*acos(0)
    • Abdelrahman Ogail
       
      Thanks Islam for the info, really useful
  • ...4 more annotations...
  • You cannot always check the equality of floating point numbers with the = = operator in C/C++. Logically their values may be same, but due to precision limit and rounding errors they may differ by some small amount and may be incorrectly deemed unequal by your program
  • #define swap(xxx, yyy) (xxx) ^= (yyy) ^= (xxx) ^= (yyy)
    • Islam TeCNo
       
      I remember someone told me that it's impossible to do swaping using macros :D ...but i think it's possible
  • But recursion should not be discounted completely, as some problems are very easy to solve recursively (DFS, backtracking)
    • Islam TeCNo
       
      Some problems are much easier when using recursion
  • Having a good understanding of probability is vital to being a good programmer
  •  
    for bignner acmers hoping to be useful !
  •  
    in this article the author discuss the common problems that faced teams in ACM contests .. and how to avoid it !
Abdelrahman Ogail

Hill climbing - Wikipedia, the free encyclopedia - 0 views

  • In computer science, hill climbing is a mathematical optimization technique which belongs to the family of local search. It is relatively simple to implement, making it a popular first choice. Although more advanced algorithms may give better results, in some situations hill climbing works just as well. Hill climbing can be used to solve problems that have many solutions, some of which are better than others. It starts with a random (potentially poor) solution, and iteratively makes small changes to the solution, each time improving it a little. When the algorithm cannot see any improvement anymore, it terminates. Ideally, at that point the current solution is close to optimal, but it is not guaranteed that hill climbing will ever come close to the optimal solution. For example, hill climbing can be applied to the traveling salesman problem. It is easy to find a solution that visits all the cities but will be very poor compared to the optimal solution. The algorithm starts with such a solution and makes small improvements to it, such as switching the order in which two cities are visited. Eventually, a much better route is obtained. Hill climbing is used widely in artificial intelligence, for reaching a goal state from a starting node. Choice of next node and starting node can be varied to give a list of related algorithms.
Abdelrahman Ogail

Common Gateway Interface - Wikipedia, the free encyclopedia - 0 views

  • The Common Gateway Interface (CGI) is a standard protocol for interfacing external application software with an information server, commonly a web server. The task of such an information server is to respond to requests (in the case of web servers, requests from client web browsers) by returning output. Each time a request is received, the server analyzes what the request asks for, and returns the appropriate output. The two basic methods for the server to do this are the following: If the request identifies a file stored on disk, then return the contents of that file. If the request identifies an executable command and possibly arguments, then run the command and return its output. CGI defines a standard way of doing the second. It defines how information about the server and the request is passed to the command in the form of arguments and environment variables, and how the command can pass back extra information about the output (such as the type) in the form of headers.
Islam TeCNo

Design and Analysis of Computer Algorithms - 0 views

  • Dijkstra's Algorithm
    • Islam TeCNo
       
      Algorithm for finding shortest path is graph
  • Huffman's Codes
    • Islam TeCNo
       
      used in data compression
  •  
    recommended !! :D Mathematics for Algorithmic Sets Functions and Relations Vectors and Matrices Linear Inequalities and Linear Equations Greedy Algorithms Knapsack Problem o O-I Knapsack o Fractional Knapsack * Activity Selection Problem * Huffman's Codes * Minimum Spanning Tree * Kruskal's Algorithm * Prim's Algorithm * Dijkstra's Algorithm Divide & Conquer Algorithms Dynamic Programming Algorithms * Knapsack Problem DP Solution * Activity Selection Problem DP Solution Amortized Analysis * Aggregate Method * Accounting Method * Potential Method * Dynamic Table Hash Table Binary Search Tree Graph Algorithms * Breadth First Search (BFS) * Depth First Search (DFS) * Topological Sort * Strongly Connected Components * Euler Tour * Generic Minimum Spanning Tree * Kruskal's Algorithm * Prim's Algorithm * Single Source Shortest Path o Dijkstra's Algorithm o Bellman-Ford Algorithm String Matching * Naïve String Matching * Knuth-Morris-Pratt Algorithm * Boyer-Moore Algorithm Sorting * Bubble Sort * Insertion Sort * Selection Sort * Shell Sort * Heap Sort * Merge Sort * Quick Sort Linear-Time Sorting * Counting Sort * Radix Sort * Bucket Sort Computational Geometry Computational Complexity * Information-Theoretic Argument * Adversary Argument * NP-Completeness And Reduction Approximate Algorithms * Vertex Cover * The Traveling Salesman Problem Linear Programming Appendix 1. Parabola 2. Tangent Codes References hoping to discuss these algorithms with each other !
  •  
    this web page contain a lot of algorithms discussed with simple ways !! i think these maybe useful Tutorials !! hoping to discuss these algorithms with each other !
  •  
    Ohhhhhhh .....Gammmeeeeeeeeed gedan ya Mans ...thanks
Islam TeCNo

Design pattern - Wikipedia, the free encyclopedia - 0 views

  • A pattern must explain why a particular situation causes problems, and why the proposed solution is considered a good one. Christopher Alexander describes common design problems as arising from "conflicting forces" -- such as the conflict between wanting a room to be sunny and wanting it not to overheat on summer afternoons. A pattern would not tell the designer how many windows to put in the room; instead, it would propose a set of values to guide the designer toward a decision that is best for their particular application. Alexander, for example, suggests that enough windows should be included to direct light all around the room. He considers this a good solution because he believes it increases the enjoyment of the room by its occupants. Other authors might come to different conclusions, if they place higher value on heating costs, or material costs. These values, used by the pattern's author to determine which solution is "best", must also be documented within the pattern. A pattern must also explain when it is applicable. Since two houses may be very different from one another, a design pattern for houses must be broad enough to apply to both of them, but not so vague that it doesn't help the designer make decisions. The range of situations in which a pattern can be used is called its context. Some examples might be "all houses", "all two-story houses", or "all places where people spend time." The context must be documented within the pattern. For instance, in Christopher Alexander's work, bus stops and waiting rooms in a surgery are both part of the context for the pattern "A PLACE TO WAIT."
    • Islam TeCNo
       
      This is Not a CS related articile ....check this link !! http://en.wikipedia.org/wiki/Design_pattern_(computer_science)
  •  
    Design Patterns
  •  
    Design Patterns
‹ Previous 21 - 40 of 52 Next ›
Showing 20 items per page