backtracking

英 [ˈbæktrækɪŋ]

美 [ˈbæktrækɪŋ]

v.  原路返回; 折回; 折返; (屈于压力而)改变声明(或主张)，出尔反尔; 退缩
backtrack的现在分词

现在分词：backtracking　

计算机

COCA.43330

柯林斯词典

• VERB 改变（说法、决定等）；出尔反尔
  If youbacktrack ona statement or decision you have made, you do or say something that shows that you no longer agree with it or support it.
  1. The committee backtracked by scrapping the controversial bonus system...
     委员会改变主意，放弃了有争议的奖金制度。
  2. The finance minister backtracked on his decision.
     财政部长收回了他的决定。
• VERB 原路返回
  If youbacktrack, you go back along a path or route you have just used.
  1. Leonard jumped in his car and started backtracking...
     伦纳德跳进车里，开始原路折返。
  2. We had to backtrack to the corner and cross the street.
     我们不得不原路返回到拐角处过街。
• VERB 倒回（描述或解释内容）
  If youbacktrackin an account or explanation, you talk about things which happened before the ones you were previously talking about.
  1. Can we just backtrack a little bit and look at your primary and secondary education?
     我们能不能回过头来谈谈你的小学和中学教育？

双语例句

• Backtracking techniques can be encoded by fairly short solution programs.
  回溯演算法可以写成很短的解题程式。
• In the constitution of backtracking algorithm, the solution space tree has the massive redundant solutions.
  根据空间节点之间的铰链关系，提出了基于空间树的六自由度空间模型。
• Eight queens problem is an ancient and well-known problem, backtracking algorithm is a typical example.
  八皇后问题，是一个古老而著名的问题，是回溯算法的典型例题。
• For example, top-down parsers are guaranteed to find every possible production, but can be extremely slow because of frequence ( exponention order) backtracking.
  例如，top-down解析器可以确保找到每一个可能的产品，但可能会非常慢，因为要频繁地（指数级）进行回溯。
• Canonical LR Parsing Algorithm Based on State Backtracking Technique
  基于状态回朔技术的规范LR分析算法
• Layering, layouts, backtracking, and styling are all trivial in Seaside.
  分层、布局、回溯和样式在Seaside中是家常便饭。
• You know we don't like backtracking.
  我们可不想再跑回去搬你的垃圾了。
• In this column, you've seen how rules can be used as part of a hybrid approach that also includes search with backtracking.
  在本专栏中，您了解了如何在包含搜索和回溯功能的混合方法中使用规则。
• Implementing Fast Searching and Selective Backtracking in LP Environments
  LP环境下快速搜索与选择回溯的实现
• In graph theory, to getting shortest path must compare all possible path, basically use backtracking, the Algorithm needs longer time.
  在图论中，一般求最短路径都是通过比较各种可能的路径后而得到的，基本上都是按树的回溯方式求得。