英文字典中文字典


英文字典中文字典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       







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

whitewashing    
刷大白浆

刷大白浆

Whitewash \White"wash`\, v. t. [imp. & p. p. {Whitewashed}; p.
pr. & vb. n. {Whitewashing}.]
[1913 Webster]
1. To apply a white liquid composition to; to whiten with
whitewash.
[1913 Webster]

2. To make white; to give a fair external appearance to; to
clear from imputations or disgrace; hence, to clear (a
bankrupt) from obligation to pay debts.
[1913 Webster]

3. In various games, to defeat (an opponent) so that he fails
to score, or to reach a certain point in the game; to
skunk. [Colloq., U. S.]
[Webster 1913 Suppl.]

4. to gloss over or cover up (crimes or misfeasance).
[PJC]


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

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


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

































































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


  • Backtracking Algorithms with Search Space Pruning; TSP and . . .
    There are 92 solutions to the eight queens problem Using backtracking, you only have to look at around 15,000 branches In summary, backtracking lets us look at every possible state in the tree, but in a smart way: it lets us cut off anything we don't want to consider
  • 3. 7 Pruning the Search Space ‣ Chapter 3 Searching for . . .
    Iterative deepening reduces the space complexity at the cost of recomputing the elements on the frontier Depth-first branch and bound (DF B B) reduces the space complexity, but can search more of the space or fail to find a solution, depending on the initial bound
  • Prof. Young Park - Bradley University
    Backtracking is a systematic way to go through a search space by traversing the state space using a depth-first search with pruning Reduces the search by cutting down some branches in the tree! Backtracking is a refinement of the exhaustive brute force approach
  • Depth First Search with Pruning. Depth-first tree search with . . .
    Pruning involves removing branches of the tree that do not need to be explored, thus reducing the search space and improving efficiency This can be done when you identify that a subtree cannot
  • Use the Breadth-First Search with Branch-and-Bound - Chegg
    Show the pruned state space tree produced by using the Branch-and-Bound Pruning algorithm Specify the ‘profit’, ‘weight’ and ‘bound’ from top to bottom at each node in the pruned state space tree
  • Decision tree pruning as a search in the state space - Springer
    The problem of post-pruning can be cast as a search in a state space [ 14], where states are trees in S(T) and branch pruning is the only operator that can be applied in several ways to each tree in S(T) This space can be represented like a directed acyclic graph





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