graph-search algorithm

  • 101Quantitative comparative linguistics — is a branch of comparative linguistics that applies mathematical models to the problem of classifying language relatedness. This includes the use of computational phylogenetics and cladistics to define an optimal tree (or network) to represent a… …

    Wikipedia

  • 102LEMON (C++ library) — LEMON is an open source graph library written in C++ language. It is quite a useful tool for solving optimization problems. This means that LEMON can be a basis for applications solving different kind of optimization problems and also a starting… …

    Wikipedia

  • 103Consistent heuristic — In computer science, a consistent (or monotone) heuristic function is a strategy for search that approaches the solution in an incremental way without taking any step back. Formally, for every node N and every successor P of N generated by any… …

    Wikipedia

  • 104Radix tree — In computer science, a radix tree (also patricia trie or radix trie) is a space optimized trie data structure where each node with only one child is merged with its child. The result is that every internal node has at least two children. Unlike… …

    Wikipedia

  • 105Distributed hash table — A distributed hash table (DHT) is a class of a decentralized distributed system that provides a lookup service similar to a hash table; (key, value) pairs are stored in a DHT, and any participating node can efficiently retrieve the value… …

    Wikipedia

  • 106Список основных разделов теории алгоритмов — …

    Википедия

  • 107Journey Planner — A specialised electronic search engine used to find the best journey between two points by some means of transport. Journey planners have been widely used in the Travel industry since the 1970s by booking agents accessed through a User interface… …

    Wikipedia

  • 108Gradient descent — For the analytical method called steepest descent see Method of steepest descent. Gradient descent is an optimization algorithm. To find a local minimum of a function using gradient descent, one takes steps proportional to the negative of the… …

    Wikipedia

  • 109DFS — can refer to several things. Computing, Engineering and Mathematics File systems Depth first search, an algorithm for traversing or searching a tree DCE Distributed File System (DCE/DFS) Disc Filing System, a filesystem developed by Acorn… …

    Wikipedia

  • 110Resolution (logic) — In mathematical logic and automated theorem proving, resolution is a rule of inference leading to a refutation theorem proving technique for sentences in propositional logic and first order logic. In other words, iteratively applying the… …

    Wikipedia