backtracking

[′bak‚trak·iŋ] (computer science) A method of solving problems automatically by a systematic search of the possible solutions; the invalid solutions are eliminated and are not retried.

backtracking

(algorithm)A scheme for solving a series of sub-problems eachof which may have multiple possible solutions and where thesolution chosen for one sub-problem may affect the possiblesolutions of later sub-problems.

To solve the overall problem, we find a solution to the firstsub-problem and then attempt to recursively solve the othersub-problems based on this first solution. If we cannot, orwe want all possible solutions, we backtrack and try the nextpossible solution to the first sub-problem and so on.Backtracking terminates when there are no more solutions tothe first sub-problem.

This is the algorithm used by logic programming languagessuch as Prolog to find all possible ways of proving agoal. An optimisation known as "intelligent backtracking"keeps track of the dependencies between sub-problems and onlyre-solves those which depend on an earlier solution which haschanged.

Backtracking is one algorithm which can be used to implementnondeterminism. It is effectively a depth-first search ofa problem space.

backtracking

back·track·ing

(bak-trak'ing), The backward movement of RNA polymerase along the DNA template to a state more stable than that encountered when some base pairs disrupt the attachment of the 3' end from the active transcription site.

back·track·ing

(bak'trak-ing) The backward movement of RNA polymerase along the DNA template to a state more stable than that encountered when some base pairs disrupt the attachment of the 3' end from the active transcription site.

单词	backtracking
释义	backtracking backtracking [′bak‚trak·iŋ] (computer science) A method of solving problems automatically by a systematic search of the possible solutions; the invalid solutions are eliminated and are not retried. backtracking (algorithm)A scheme for solving a series of sub-problems eachof which may have multiple possible solutions and where thesolution chosen for one sub-problem may affect the possiblesolutions of later sub-problems. To solve the overall problem, we find a solution to the firstsub-problem and then attempt to recursively solve the othersub-problems based on this first solution. If we cannot, orwe want all possible solutions, we backtrack and try the nextpossible solution to the first sub-problem and so on.Backtracking terminates when there are no more solutions tothe first sub-problem. This is the algorithm used by logic programming languagessuch as Prolog to find all possible ways of proving agoal. An optimisation known as "intelligent backtracking"keeps track of the dependencies between sub-problems and onlyre-solves those which depend on an earlier solution which haschanged. Backtracking is one algorithm which can be used to implementnondeterminism. It is effectively a depth-first search ofa problem space. backtracking back·track·ing (bak-trak'ing), The backward movement of RNA polymerase along the DNA template to a state more stable than that encountered when some base pairs disrupt the attachment of the 3' end from the active transcription site. back·track·ing (bak'trak-ing) The backward movement of RNA polymerase along the DNA template to a state more stable than that encountered when some base pairs disrupt the attachment of the 3' end from the active transcription site.
随便看	dig yourself into a hole dig yourself out of a hole dih diha dihad dihalide dihaloacetic acid dihalo-acetonitrile dihang dihaploid dihati, muhammad masud di-he dihe dihedral dihedral angle dihedral angle and secondary structure database of short amino acid fragments dihedral angles dihedral effect dihedral group dihedral group d2 dihedral group d3 dihedral group d4 dihedral group d5 dihedral group d7 dihedral reflector