Skip to main content

Home/ Computer Science Knowledge Sharing/ Group items tagged reference

Rss Feed Group items tagged

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

Belief-Desire-Intention software model - Wikipedia, the free encyclopedia - 0 views

  • The Belief-Desire-Intention (BDI) software model (usually referred to simply, but ambiguously, as BDI) is a software model developed for programming intelligent agents. Superficially characterized by the implementation of an agent's beliefs, desires and intentions, it actually uses these concepts to solve a particular problem in agent programming. In essence, it provides a mechanism for separating the activity of selecting a plan (from a plan library) from the execution of currently active plans. Consequently, BDI agents are able to balance the time spent on deliberating about plans (choosing what to do) and executing those plans (doing it). A third activity, creating the plans in the first place (planning), is not within the scope of the model, and is left to the system designer and programmer.
    • Abdelrahman Ogail
       
      This model is used to simulate human behavior its under area of research and its so interesting and innovative
    • Islam TeCNo
       
      nice ..... dah tab3an related lel AI !
Islam TeCNo

Ternary relation - Wikipedia, the free encyclopedia - 0 views

  • n mathematics, a ternary relation or triadic relation is a finitary relation in which the number of places in the relation is three. Ternary relations may also be referred to as 3-adic, 3-ary, 3-dimensional, or 3-place. Just as a binary relation is formally defined as a set of pairs, i.e. a subset of the Cartesian product A × B of some sets A and B, so a ternary relation is a set of triples, forming a subset of the Cartesian product A × B × C of three sets A, B and C.
    • Abdelrahman Ogail
       
      Well known relation types is binary relation. Also ternary relation is a basic relation type
    • Islam TeCNo
       
      thanks zikas .... we bardo fe 7aga esmaha Ternary Search zaii ma fe binary search
Abdelrahman Ogail

Belief-Desire-Intention software model - Wikipedia, the free encyclopedia - 0 views

  • The Belief-Desire-Intention (BDI) software model (usually referred to simply, but ambiguously, as BDI) is a software model developed for programming intelligent agents. Superficially characterized by the implementation of an agent's beliefs, desires and intentions, it actually uses these concepts to solve a particular problem in agent programming. In essence, it provides a mechanism for separating the activity of selecting a plan (from a plan library) from the execution of currently active plans. Consequently, BDI agents are able to balance the time spent on deliberating about plans (choosing what to do) and executing those plans (doing it). A third activity, creating the plans in the first place (planning), is not within the scope of the model, and is left to the system designer and programmer.
    • Abdelrahman Ogail
       
      Stress on the point "BDI Agents spent time about choosing what to do more that how to execute them"
Abdelrahman Ogail

Mutation testing - Wikipedia, the free encyclopedia - 1 views

  • Mutation testing (or Mutation analysis) is a method of software testing, which involves modifying program's source code in small ways.[1] These, so-called mutations, are based on well-defined mutation operators that either mimic typical programming errors (such as using the wrong operator or variable name) or force the creation of valuable tests (such as driving each expression to zero). The purpose is to help the tester develop effective tests or locate weaknesses in the test data used for the program or in sections of the code that are seldom or never accessed during execution.
  • For example, consider the following C++ code fragment: if (a && b) c = 1; else c = 0; The condition mutation operator would replace '&&' with '||' and produce the following mutant: if (a || b) c = 1; else c = 0;
  • Many mutation operators can produce equivalent mutants. For example, consider the following code fragment: int index=0; while (...) { . . .; index++; if (index==10) break; } Boolean relation mutation operator will replace "==" with ">=" and produce the following mutant: int index=0; while (...) { . . .; index++; if (index>=10) break; }
Abdelrahman Ogail

Stochastic optimization - Wikipedia, the free encyclopedia - 0 views

  • Stochastic optimization (SO) methods are optimization algorithms which incorporate probabilistic (random) elements, either in the problem data (the objective function, the constraints, etc.), or in the algorithm itself (through random parameter values, random choices, etc.), or in both [1]. The concept contrasts with the deterministic optimization methods, where the values of the objective function are assumed to be exact, and the computation is completely determined by the values sampled so far.
  •  
    In Artificial Intelligence, Genetic Algorithms belongs to class Stochastic search that is explained below
Janos Haits

Ohloh, the open source network - 1 views

  •  
    Discover, Track and Compare Open Source
Janos Haits

BabelNet | The largest multilingual encyclopedic dictionary and semantic network - 0 views

  •  
    "BabelNet is both a multilingual encyclopedic dictionary, with lexicographic and encyclopedic coverage of terms, and a semantic network which connects concepts and named entities in a very large network of semantic relations, made up of about 15 million entries, called Babel synsets. Each Babel synset represents a given meaning and contains all the synonyms which express that meaning in a range of different languages. Its evolution, BabelNet live, is a new, continuously growing resource, .."
Janos Haits

Talk to Books - 0 views

  •  
    "Browse passages from books using experimental AI"
Janos Haits

Knil | The best way to search and find when you're mobile - 0 views

  •  
    "Knil structures the information of the web into actionable knowledge"
Janos Haits

Zotero | Home - 0 views

  •  
    A personal research assistant. Zotero is the only research tool that automatically senses content, allowing you to add it to your personal library with a single click. Whether you're searching for a preprint on arXiv.org, a journal article from JSTOR, a news story from the New York Times, or a book from your university library catalog, Zotero has you covered with support for thousands of sites.
Janos Haits

Semantic Scholar - 0 views

  •  
    "Semantic Scholar is a free, nonprofit, academic search engine from AI2."
Janos Haits

Semantic Overflow - 0 views

  •  
    Semantic Overflow For questions about semantic web techniques and technologies.
Janos Haits

Malwarebytes Cybersecurity for Windows, Mac, Android & iOS | Malwarebytes - 0 views

  •  
    "We redesigned Malwarebytes for Windows inside and out to be more intuitive, tougher against threats, and easier on your PC."
Janos Haits

searchcode | source code search engine - 0 views

  •  
    'Type in anything you want to find and you will be presented with the results that match with the relevant lines highlighted. Searches can filtered down using the filter panel. Some suggested search terms,'
Janos Haits

OAS - 0 views

  •  
    "Advance scientific research. Promote technology. For the good of all humanity. Open Academic Search (OAS) is a working group aiming to advance scientific research and discovery, promote technology that assists the scientific and academic communities, and make research available worldwide for the good of all humanity."
Janos Haits

searx - 0 views

  •  
    "Privacy-respecting metasearch engine"
‹ Previous 21 - 40 of 58 Next ›
Showing 20 items per page