英文字典中文字典


英文字典中文字典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英翻中〔查看〕

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


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

































































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


  • O que é um algoritmo Backtracking? - Stack Overflow em Português
    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)
  • 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
  • Difference between back tracking and dynamic programming
    Backtracking is a general algorithm for finding all (or some) solutions to some computational problem, that incrementally builds candidates to the solutions, and abandons each partial candidate c ("backtracks") as soon as it determines that c cannot possibly be completed to a valid solution
  • 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
  • Is there a way to test if my regex is vulnerable to catastrophic . . .
    More drastic approaches to mitigate catastrophic backtracking in node js are wrapping your regex efforts in a child process or vm context and set a meaningful timeout (In a perfect world JavaScript's RegExp constructor would have a timeout param, maybe someday ) The approach of using a child process is described here on SO
  • Security hotspot issue with regex in sonar qube - Stack Overflow
    The issue is: Make sure the regex used here, which is vulnerable to polynomial runtime due to backtracking, cannot lead to denial of service Using slow regular expressions is security-sensitivejava:
  • Time complexity of N Queen using backtracking? - Stack Overflow
    O (n^n) is definitely an upper bound on solving n-queens using backtracking I'm assuming that you are solving this by assigning a queen column-wise However, consider this - when you assign a location of the queen in the first column, you have n options, after that, you only have n-1 options as you can't place the queen in the same row as the first queen, then n-2 and so on Thus, the worst
  • Optimizing the backtracking algorithm solving Sudoku
    It is basically a backtracking algorithm which brute forces the search space I have posted more details on the actual algorithm in this thread Here however I would like to focus more on the optimization process To be more precise, I have explored different approaches to minimize the solve time and the number of iterations
  • SonarQube showing Regular expression Denial of Service (ReDoS)
    I am validating date using regex in JavaScript but when I run SonarQube for code analysis It is showing the regex as a security vulnerability Example 1: Below is the regex pattern (link to sour
  • 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