- Sektör: Technology
- Number of terms: 2742
- Number of blossaries: 0
- Company Profile:
The National Institute of Standards and Technology (NIST) — known between 1901 and 1988 as the National Bureau of Standards (NBS) — is a measurement standards laboratory and a non-regulatory agency of the United States Department of Commerce. The institute's official mission is to promote U.S. ...
Sequential space is a polynomial of parallel time.
Industry:Computer science
Set of words such that no word of the set is a prefix of another word in the set. A prefix code may be represented by a coding tree.
Industry:Computer science
Solve a problem by repeatedly working on successive parts of the problem.
Industry:Computer science
Solve a problem, either directly because solving that instance is easy (typically, because the instance is small) or by dividing it into two or more smaller instances. Each of these smaller instances is recursively solved, and the solutions are combined to produce a solution for the original instance.
Industry:Computer science
Solve an optimization problem by caching subproblem solutions (memoization) rather than recomputing them.
Industry:Computer science
Solve an optimization problem by finding locally optimal solutions.
Industry:Computer science
Solve the assignment problem in polynomial time by marking and unmarking entries and covering and uncovering rows and columns.
Industry:Computer science
Solve the assignment problem in polynomial time by marking and unmarking entries and covering and uncovering rows and columns.
Industry:Computer science
Solve the single-source shortest-path problem in a weighted directed acyclic graph by 1) doing a topological sort on the vertices by edge so vertices with no incoming edges are first and vertices with only incoming edges are last, 2) assign an infinite distance to every vertex (dist(v)=∞) and a zero distance to the source, and 3) for each vertex v in sorted order, for each outgoing edge e(v,u), if dist(v) + weight(e) < dist(u), set dist(u)=dist(v) + weight(e) and the predecessor of u to v.
Industry:Computer science
Some of the entries of the auxiliary array used in a string matching algorithm. An entry is d-extremal if it is the deepest entry on its diagonal to be given value d.
Industry:Computer science
