Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Linear search problem (view)

searching for Search problem 75 found (101 total)

Rendezvous problem (586 words) [view diff] exact match in snippet view article find links to article

Richard Weber. This was the first non-trivial symmetric rendezvous search problem to be fully solved. The corresponding asymmetric rendezvous problem

Nearest neighbor search (3,339 words) [view diff] exact match in snippet view article find links to article

the larger the function values. Formally, the nearest-neighbor (NN) search problem is defined as follows: given a set S of points in a space M and a query

Quantum counting algorithm (1,678 words) [view diff] exact match in snippet view article find links to article

algorithm for efficiently counting the number of solutions for a given search problem. The algorithm is based on the quantum phase estimation algorithm and

Bidirectional search (1,240 words) [view diff] exact match in snippet view article find links to article

in many cases it is faster: for instance, in a simplified model of search problem complexity in which both searches expand a tree with branching factor

Doctor Fischer of Geneva (1,462 words) [view diff] exact match in snippet view article find links to article

The eponymous party has been examined as an example of a statistical search problem. The story is narrated by Alfred Jones, a translator for a large chocolate

FNP (complexity) (589 words) [view diff] exact match in snippet view article

FNP, the search problem associated with P(x,y) is: given x, find a y such that P(x,y) holds, or state that no such y exists. The search problem for every

PPA (complexity) (548 words) [view diff] exact match in snippet view article

searching for something that is guaranteed to exist (so, we have a total search problem). PPA is defined as follows. Suppose we have a graph on whose vertices

Algebraic Eraser (1,622 words) [view diff] case mismatch in snippet view article find links to article

Simultaneous Conjugacy Search Problem (GSCSP) within the braid group. This is a distinct and different hard problem than the Conjugacy Search Problem (CSP), which

Cellular evolutionary algorithm (1,166 words) [view diff] no match in snippet view article find links to article

the individual, which encodes a tentative (optimization, learning, search) problem solution. The essential idea of this model is to provide the EA population

Best bin first (176 words) [view diff] exact match in snippet view article find links to article

to efficiently find an approximate solution to the nearest neighbor search problem in very-high-dimensional spaces. The algorithm is based on a variant

Fixed-radius near neighbors (418 words) [view diff] exact match in snippet view article find links to article

fixed-radius near neighbor problem is a variant of the nearest neighbor search problem. In the fixed-radius near neighbor problem, one is given as input a

Gene prediction (3,527 words) [view diff] exact match in snippet view article find links to article

masking. Gene prediction is closely related to the so-called 'target search problem' investigating how DNA-binding proteins (transcription factors) locate

Stochastic diffusion search (697 words) [view diff] exact match in snippet view article find links to article

cheap, partial evaluations of a hypothesis (a candidate solution to the search problem). They then share information about hypotheses (diffusion of information)

(1+ε)-approximate nearest neighbor search (190 words) [view diff] exact match in snippet view article

(1+ε)-approximate nearest neighbor search is a variant of the nearest neighbor search problem. A solution to the (1+ε)-approximate nearest neighbor search is a point

Min-conflicts algorithm (1,039 words) [view diff] exact match in snippet view article find links to article

Because a constraint satisfaction problem can be interpreted as a local search problem when all the variables have an assigned value (called a complete state)

Admissible heuristic (1,157 words) [view diff] exact match in snippet view article find links to article

search algorithm. In order for a heuristic to be admissible to the search problem, the estimated cost must always be lower than or equal to the actual

PLS (complexity) (5,456 words) [view diff] exact match in snippet view article

which the local optimality can be verified in polynomial time. A local search problem is in PLS, if the following properties are satisfied: The size of every

Search-based software engineering (2,312 words) [view diff] exact match in snippet view article find links to article

SBSE converts a software engineering problem into a computational search problem that can be tackled with a metaheuristic. This involves defining a search

Stack search (221 words) [view diff] exact match in snippet view article find links to article

Stack search is not guaranteed to find the optimal solution to the search problem. The quality of the result depends on the quality of the search heuristic

Non-commutative cryptography (1,807 words) [view diff] exact match in snippet view article find links to article

in G such that v = ux, that is, such that v = x−1 ux. The conjugacy search problem: Given two elements u and v in a group G find an element x in G such

Findability (1,457 words) [view diff] exact match in snippet view article find links to article

is Page One, mentions that findability "is a content problem, not a search problem". Even when the right content is present, users often find themselves

Grover's algorithm (4,626 words) [view diff] exact match in snippet view article find links to article

blocks, each of size b = N / K {\displaystyle b=N/K} . The partial search problem is easier. Consider the approach we would take classically – we pick

Ellipsoid method (3,656 words) [view diff] exact match in snippet view article find links to article

duality says that we can reduce the above minimization problem to the search problem: find x,y s.t. Ax ≤ b ; ATy = c ; y ≤ 0 ; cTx=bTy. The first problem

Search cost (2,875 words) [view diff] exact match in snippet view article find links to article

a choice value tied to looking again at any price, and the optimum search problem is related to the "optimal stopping" issue. [22] Numerous search cost

Learning with errors (3,418 words) [view diff] exact match in snippet view article find links to article

search problem, the decision version can be solved easily: just feed the input samples for the decision problem to the solver for the search problem.

Real-time kinematic positioning (1,185 words) [view diff] exact match in snippet view article find links to article

is 19 cm for the L1 signal. Solving this so-called integer ambiguity search problem results in centimeter precision. The error can be reduced with sophisticated

Ball tree (1,401 words) [view diff] exact match in snippet view article find links to article

trees have been shown to perform fairly well on the nearest-neighbor search problem, particularly as their number of dimensions grows. However, the best

Binary search algorithm (9,639 words) [view diff] exact match in snippet view article find links to article

probability that the procedure yields the wrong position. The noisy binary search problem can be considered as a case of the Rényi-Ulam game, a variant of Twenty

Six degrees of separation (4,942 words) [view diff] exact match in snippet view article find links to article

principle and lateral diffusion. Bakhshandeh et al. have addressed the search problem of identifying the degree of separation between two users in social

Persistent data structure (6,207 words) [view diff] exact match in snippet view article find links to article

Using this persistent data structure we can solve the next element search problem in O ( L o g ( n ) ) {\displaystyle O(Log(n))} query time and O ( n

USS Dale (DD-4) (379 words) [view diff] exact match in snippet view article

First Torpedo Flotilla on the Atlantic coast, taking part in a fleet search problem conducted off Maine, and passing before President Theodore Roosevelt

A* search algorithm (4,767 words) [view diff] exact match in snippet view article find links to article

navigating from place to place. […] Shakey's navigation problem is a search problem, similar to ones I have mentioned earlier. Nilsson, Nils J. (2009-10-30)

USS Lawrence (DD-8) (549 words) [view diff] exact match in snippet view article

Lawrence operated along the Atlantic coast, taking part in the fleet search problem off the New England coast during the summer of 1903. The torpedo boat

USS Lawrence (DD-8) (549 words) [view diff] exact match in snippet view article

Lawrence operated along the Atlantic coast, taking part in the fleet search problem off the New England coast during the summer of 1903. The torpedo boat

Quantum computing (12,225 words) [view diff] exact match in snippet view article find links to article

established a quantum speedup for the widely applicable unstructured search problem. The same year, Seth Lloyd proved that quantum computers could simulate

Sorting algorithm (6,394 words) [view diff] exact match in snippet view article find links to article

by a computed key Search algorithm – Any algorithm which solves the search problem Quantum sort – Sorting algorithms for quantum computers "Meet the 'Refrigerator

Cell-probe model (1,280 words) [view diff] exact match in snippet view article find links to article

disjoint-set data structure is optimal. The exact nearest neighbor search problem is to determine the closest in a set of input points to a given query

Lead (18,907 words) [view diff] case mismatch in snippet view article find links to article

Forensic Search Project. "Decay Chains". Nuclear Forensics: A Scientific Search Problem. Retrieved 23 November 2015. Vasmer, M. (1986–1987) [1950–1958]. Trubachyov

Quantum algorithm (4,558 words) [view diff] exact match in snippet view article find links to article

in polynomial time. Quantum counting solves a generalization of the search problem. It solves the problem of counting the number of marked entries in an

Answer set programming (2,839 words) [view diff] exact match in snippet view article find links to article

"potential solutions"—a simple superset of the set of solutions to the given search problem. It is followed by a constraint, which eliminates all potential solutions

B-tree (7,034 words) [view diff] exact match in snippet view article find links to article

milliseconds to get the record. The auxiliary indices have turned the search problem from a binary search requiring roughly log2 N disk reads to one requiring

Paradox (theorem prover) (426 words) [view diff] exact match in snippet view article

techniques which help to reduce the computational complexity of the model search problem: term definitions, new variable reduction technique, incremental satisfiability

Crystal structure prediction (1,425 words) [view diff] exact match in snippet view article find links to article

molecular organic crystals). For complex non-molecular crystals (where the "search problem" is most acute), major recent advances have been the development of

Video search engine (2,301 words) [view diff] exact match in snippet view article find links to article

Diego and Carnegie Mellon University have been working on the visual search problem for more than 15 years, and admitted at a "Future of Search" conference

Twing (560 words) [view diff] exact match in snippet view article find links to article

filtering methods available. This is an attempt to solve the generalized search problem of ambiguity that often occurs in search results as well as forum search

LPBoost (1,949 words) [view diff] exact match in snippet view article find links to article

function value for any restricted instance. Then, we can formulate a search problem for the 'most violated constraint' in the original problem space, namely

List of algorithms (7,843 words) [view diff] exact match in snippet view article find links to article

Best Bin First: find an approximate solution to the nearest neighbor search problem in very-high-dimensional spaces Newton's method in optimization Nonlinear

Accomable (388 words) [view diff] exact match in snippet view article find links to article

Retrieved 2018-05-15. "Accomable wants to solve the accessible holiday search problem – TechCrunch". techcrunch.com. 4 May 2016. Retrieved 2018-05-15. "United

Contrast set learning (2,181 words) [view diff] exact match in snippet view article find links to article

set learner treats the task of learning from contrast sets as a tree search problem where the root node of the tree is an empty contrast set. Children are

Single-molecule magnet (3,168 words) [view diff] exact match in snippet view article find links to article

utilized for the Grover algorithm, a quantum search theory. The quantum search problem typically requests for a specific element to be retrieved from an unordered

DNA binding site (2,168 words) [view diff] exact match in snippet view article find links to article

searching for additional members of a known DNA binding motif (the site search problem) and discovering novel DNA binding motifs in collections of functionally

USS Washington (ACR-11) (3,841 words) [view diff] exact match in snippet view article

by President William Howard Taft. The cruiser then participated in a search problem out of Newport, R.I. from 9–18 November before she sailed for the West

Planted motif search (4,694 words) [view diff] exact match in snippet view article find links to article

function, human disease, and may serve as therapeutic drug targets. The search problem may be summarized as follows: Input are n strings (s1, s2, ... , sn)

List of Google April Fools' Day jokes (15,440 words) [view diff] exact match in snippet view article find links to article

on the main Google search page with the introduction, "Dating is a search problem. Solve it with Google Romance." It pretends to offer a "Soulmate Search"

Fully polynomial-time approximation scheme (5,014 words) [view diff] exact match in snippet view article find links to article

paths and non-linear objectives. Counting edge-covers. Vector subset search problem where the dimension is fixed. The "benevolent dynamic programs", that

Multiplicative binary search (395 words) [view diff] case mismatch in snippet view article find links to article

Compiler Code Generation for Multiway Branch Statements as a Static Search Problem (Technical report). Department of Computer Science, James Cook University

Control table (6,465 words) [view diff] case mismatch in snippet view article find links to article

Compiler Code Generation for Multiway Branch Statements as a Static Search Problem Programs must be written for people to read, and only incidentally for

Public participation in patent examination (2,361 words) [view diff] exact match in snippet view article find links to article

companies with intellectual property portfolios by crowdsourcing the search problem to technical and scientific subject-matter experts. Patexia provides

Isolation lemma (1,903 words) [view diff] exact match in snippet view article find links to article

find the matching. More generally, the paper also observed that any search problem of the form "Given a set system ( S , F ) {\displaystyle (S,{\mathcal

Lion algorithm (2,306 words) [view diff] exact match in snippet view article find links to article

a lion, lioness and their cubs, that are potential solutions of the search problem. Fertility evaluation: A process of evaluating whether the territorial

Pierre Sprey (2,017 words) [view diff] case mismatch in snippet view article find links to article

"Shut up about the F-35". YouTube. Analysis of the General Circular Search Problem. Cornell Univ. 1960. Schudel, Matt. "Pierre Sprey, Pentagon analyst

USS Bainbridge (DD-1) (3,241 words) [view diff] exact match in snippet view article

and exercises in New England waters. Those evolutions consisted of a search problem followed by joint maneuvers with units of the Army, most of which took

Fluid construction grammar (788 words) [view diff] exact match in snippet view article find links to article

Pieter Wellens, and others. FCG treats parsing and production as a search problem, in which the FCG engine searches for the best utterance to verbalize

TFNP (2,698 words) [view diff] exact match in snippet view article find links to article

contains all problems that can be reduced in polynomial time to the search problem End-of-Potential-Line: Given input circuits S, P each with n input and

Rouben V. Ambartzumian (1,102 words) [view diff] exact match in snippet view article find links to article

Ambartzumian, R. V. (2013) Parallel X-ray tomography of convex domains as a search problem in two dimensions. Հայաստանի ԳԱԱ Տեղեկագիր. Մաթեմատիկա, 48 (1). pp. 37–52

Berlekamp switching game (1,968 words) [view diff] exact match in snippet view article find links to article

doi:10.4064/cm-23-1-165-171. MR 0307944. Gleason, Andrew M. (1960). "A search problem in the n {\displaystyle n} -cube". In Bellman, Richard; Hall, Marshall

Fractional cascading (3,868 words) [view diff] exact match in snippet view article find links to article

is above or below one of the paths can itself be solved as a binary search problem, searching for the x coordinate of the points among the x coordinates

Community search (1,090 words) [view diff] exact match in snippet view article find links to article

12539 [cs.DB]. Sozio, Mauro; Gionis, Aristides (2010). "The community-search problem and how to plan a successful cocktail party". Proceedings of the 16th

♯P-completeness of 01-permanent (4,040 words) [view diff] exact match in snippet view article find links to article

interesting #P-complete problems are those for which the corresponding search problem can be solved in polynomial time. The PERMANENT problem for 0–1 matrices

Partial-order planning (1,419 words) [view diff] exact match in snippet view article find links to article

the goal and possible actions. The problem can be interpreted as a search problem where the set of possible partial-order plans is the search space. The

Stable model semantics (4,921 words) [view diff] exact match in snippet view article find links to article

perspective on such programs. In that programming paradigm, a given search problem is represented by a logic program so that the stable models of the program

Sparse distributed memory (7,729 words) [view diff] exact match in snippet view article find links to article

a dataset of stored words. or, in other words, the Nearest neighbor search problem. Consider a memory with N locations where N = 2 n {\displaystyle N=2^{n}}

Consensus splitting (5,997 words) [view diff] exact match in snippet view article find links to article

computing an approximation to an exact solution of the Borsuk-Ulam search problem. This means that it is complete for the complexity class BU – a superclass

Hierarchical navigable small world (485 words) [view diff] case mismatch in snippet view article find links to article

(2012). "Scalable Distributed Algorithm for Approximate Nearest Neighbor Search Problem in High Dimensional General Metric Spaces". In Navarro, Gonzalo; Pestov

Gemini (chatbot) (8,458 words) [view diff] exact match in snippet view article

2023). "For tech giants, AI like Bing and Bard poses billion-dollar search problem". Reuters. Archived from the original on February 24, 2023. Retrieved