英文字典中文字典


英文字典中文字典51ZiDian.com



中文字典辞典   英文字典 a   b   c   d   e   f   g   h   i   j   k   l   m   n   o   p   q   r   s   t   u   v   w   x   y   z       







请输入英文单字，中文词皆可：

backtracking    音标拼音: [b'æktr,ækɪŋ]
回溯法,回溯

回溯法,回溯

backtracking
回溯法

backtracking
回溯法

A scheme for solving a series of sub-problems each
of which may have multiple possible solutions and where the
solution chosen for one sub-problem may affect the possible
solutions of later sub-problems.

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

This is the algorithm used by {logic programming} languages
such as {Prolog} to find all possible ways of proving a
{goal}. An optimisation known as "{intelligent backtracking}"
keeps track of the dependencies between sub-problems and only
re-solves those which depend on an earlier solution which has
changed.

Backtracking is one {algorithm} which can be used to implement
{nondeterminism}. It is effectively a {depth-first search} of
a {problem space}.

(1995-04-13)


请选择你想看的字典辞典：
单词字典翻译
backtracking查看　backtracking　在百度字典中的解释百度英翻中〔查看〕
backtracking查看　backtracking　在Google字典中的解释Google英翻中〔查看〕
backtracking查看　backtracking　在Yahoo字典中的解释Yahoo英翻中〔查看〕

安装中文字典英文字典查询工具!


中文字典英文字典工具:
选择颜色:
输入中英文单字

































































英文字典中文字典相关资料:


  • Whats the difference between backtracking and depth first search?
    Backtracking is a more general purpose algorithm Depth-First search is a specific form of backtracking related to searching tree structures From Wikipedia: One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking It uses backtracking as part of its means of working with a tree, but is limited to a tree
  • data structures - Difference between backtracking and recursion . . .
    Backtracking algorithms can be seen as a way to systematically explore the solution space, testing different combinations and configurations by trying out options and backtracking when necessary The key idea is to make a choice, explore its consequences, and if it leads to a dead end, undo the choice (backtrack) and try a different one
  • regex - In regular expressions, what is a backtracking back . . .
    Backreferences and backtracking are two different things The former is using the results of a capture later in code, e g (['"]) *?\1 This will match a single- or double-quoted string (ignoring escapes for the moment) It uses a backreference to refer to the open symbol (the single or double quote) so it can match that at the end Backtracking, on the other hand, is what regular expressions
  • O que é um algoritmo Backtracking? - Stack Overflow em Português
    10 Backtracking é um algoritmo genérico que busca, por força bruta, soluções possíveis para problemas computacionais (tipicamente problemas de satisfações à restrições) De maneira incremental, busca por candidatos à soluções e abandona cada candidato parcial C quando C não pode resultar em uma solução válida
  • java - Why is this called backtracking? - Stack Overflow
    Backtracking is a form of recursion, at times This boolean based algorithm is being faced with a choice, then making that choice and then being presented with a new set of choices after that initial choice
  • Resolving new pip backtracking runtime issue - Stack Overflow
    Backtracking might be useful feature but you don't want to wait hours to complete with uncertain success I found several option that might help: Use the old resolver (--use-deprecated=legacy-resolver) proposed in the answer by @Daniel Davee, but this is more like temporary solution than a proper one Skip resolving dependencies with --no-deps
  • Explain BFS and DFS in terms of backtracking - Stack Overflow
    The confusion comes in because backtracking is something that happens during search, but it also refers to a specific problem-solving technique where a lot of backtracking is done
  • How to calculate time complexity of backtracking algorithm?
    If you focus on the actual backtracking (or rather the branching possibilities at each step) you'll only ever see exponential complexity However, if there's only so many possible states for the backtracking to explore, that's all it can explore If you ensure your algorithm only visits each possible state once (and with a constant bound on time per state), then the number of possible states
  • How to avoid Catastrophic Backtracking in RegExp?
    The group is also repeated zero or more times, that will lead to catastrophic backtracking because the optional [-\s] means there are many ways to match the same input





中文字典-英文字典  2005-2009