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?
     我们能不能回过头来谈谈你的小学和中学教育？

双语例句

• A backtracking algorithm has been suggested to solve the issue of maximizing credit rewards.
  并应用回溯算法求解信度收益最大化问题。
• The engine will discard all backtracking positions.
  引擎会忽略所有的回溯位置。
• Leonard jumped in his car and started backtracking
  伦纳德跳进车里，开始原路折返。
• Layering, layouts, backtracking, and styling are all trivial in Seaside.
  分层、布局、回溯和样式在Seaside中是家常便饭。
• According to the "surplus character", a" surplus heuristic backtracking "strategy is put forward by improving the efficiency of backtracking greatly.
  根据选管工艺的余料特性，提出了余料启发式回溯的求解策略，大大地提高了回溯效率。
• The Bad: Action elements are sometimes poorly implemented with lots of backtracking; characters can level unevenly.
  缺点：（戏的）作规则有时候在许多回溯进程上会执行的不彻底（翻译，需要懂行的、过的朋友指正）角色的等级不平衡。
• Each time the regex finds an intermediate tag and exits a lookahead, it throws away all backtracking positions from within the lookahead.
  正则表达式每次找到一个中间标签就退出一个前瞻，它在前瞻过程中丢弃所有回溯位置。
• Algorithm for backtracking control strategies
  回溯控制策略的算法
• It also has a method to determine the next child node to consider after backtracking.
  它还使用一种方法判断在返回后下一个要进行猜测的子节点。
• Depth-first search is an algorithm for searching a tree structure starting from an initial node and exploring as far as possible along a branch until either the goal node or a dead end is reached before stopping or backtracking.
  深度优先搜索将从一个初始节点开始搜索一个树形结构，并尽可能从一个分支开始搜索，在到达目标节点或分支的尽头后停止或回溯。