I saw patterns that showed that the tree design avoided the problem of shade from other objects.
我意识到树木表现出来的这种布局模式避免了被其它物体遮挡的问题。
You, the developer, have to express your problem in terms of tree manipulation.
开发人员必须按照树操作表达自己的问题。
To solve this problem, you can use tables to create a tree view list.
为了解决这个问题，可以使用表格创建树视图列表。
Build processes that work with code from a single tree have no problem with the dependencies and do nothing to discourage their construction.
创建流程在创建单一树的代码时不存在依赖问题，且也不会影响其结构。
In the above example, a simple hashmap or binary search tree could have easily solved the problem, but implementing one of these data structures in XSL would be inconvenient and unnecessary.
在上面的示例中，如果使用一个简单的散列图(hashmap)或二进制搜索树就可以轻易地解决问题，但是用XSL实现一个这样的数据结构并不是很方便，并且是不必要的。
A well-known solution to the problem of traversing and modifying a tree in functional programming is the zipper, most famously described by Gerard Huet (see Resources).
在函数式编程中，解决遍历和修改树的问题的一种知名的解决方法就是zippers (zipper)，因gerard Huet(参见参考资料)的描述而闻名于世。
The answer to this problem — at least, the answer chosen by today's Web browsers — is to use a tree structure to represent HTML.
这个问题的答案(至少是由当今Web浏览器选择的答案)是使用树结构来表示HTML。
Unfortunately, your dog may detect a "problem" that you can't see or hear, such as a siren miles away or the neighbor's cat hiding in the tree outside the window.
遗憾的是，你的狗狗发现的问题你看不到也听不到，例如像一英里以外的汽笛声，邻居家的猫躲在窗外的树上。
And then discusses the difficult problem in the design of software: the data structure of the tree after analyzing and designing the basic data demanded by the system.
并对系统所需的基础数据进行了分析与设计，对软件设计中的难点问题——树的数据结构进行了探讨。
Representation of tree is a difficult problem in 3dgis.
在3dgis中，树的表达是一个难点问题。
At first, this thesis introduces the VLSI physical design process, based on this leads to the rectilinear Steiner tree problem.
本文首先介绍了超大规模集成电路的物理设计流程，在此基础上引出直角斯坦纳树问题。
Physicists have no problem answering the question of "If a tree falls in the woods and no one's there to hear it, does it make a sound?"
物理学家回答这样的问题是完全不成问题的：即“如果一棵树倒在树林里并且那里没有人听见声音，那么树倒下发出声音了吗？”
By careful researches of the traversal of binary tree, a new method of traversing binary tree is brought forward, which is able to solve the problem of traversal of binary tree.
对二叉树的遍历过程进行深入地研究，提出一种生成二叉树遍历序列的新方法，解决了二叉树遍历序列的生成问题。
Up to now, the decision tree method is used to find the optimal solution of a Bayesian decision problem, that is, to select an optimal one from several decision alternatives.
决策树方法一直被用于贝叶斯决策问题的最优方案选择，即从若干决策方案中选择一个最优方案。
The paper studies the application layer multicast networks of MSNs, and presents a heuristic BCT algorithm for degree-constrained minimum diameter spanning tree problem.
本文研究了由MSN节点组成的应用层组播网络，提出了度约束最小直径生成树问题，并给出了求解该问题的BCT算法。
In this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.
提出了求解度约束最小生成树问题的单亲遗传算法。
Variety bias exists in many decision tree algorithms, and in the past people analyzed this problem mainly based on experiments.
多值偏向是决策树算法中普遍存在的问题，以往人们对于多值偏向问题的分析主要是基于实验观测的。
In this paper, a new tree automata based machine, XEBT, is proposed to solve the problem.
提出了基于树自动机的XEBT机来解决这个问题。
This article gives three algorithms for all permutations of 1 to N, analyzing the application of this problem in stack and enumeration of binary tree.
文章给出了1至N全排列问题的三种求解算法，分析了该问题在栈及二叉树计数中的应用。
Apply the standard tools of VGC mechanism design to solve the minimum spanning tree problem.
文中将机制设计的标准工具VGC机制应用到解决最小支撑树问题。
In the paper, the problem of freeway incident duration prediction is studied by decision tree method.
利用决策树方法对高速公路事件持续时间预测问题进行研究。
The problem of determining such a constrained tree is NP complete.
确定这样一棵约束树的问题是NP-完全的。
The capacitated minimum spanning tree problem (CMST), one of the most fundamental problems in telecommunications and in the optimal design of networks, is studied.
研究流量约束最小生成树问题（CMST），它是通讯和网络优化设计中最为基础和重要的问题之一。
This paper establishes the cheating model of ALM nodes, and discusses the instability problem of ALM tree on the occurrence of node cheating when there is no multicast member changing.
本文建立了应用层组播节点的欺骗模型，并讨论了在固定组成员的情况下，节点欺骗引起的组播树不稳定问题。
The experiment results show that it is effective on solving Degree - constrained Minimum Spanning Tree Problem.
实验结果表明，这种用遗传算法解决度约束的最小生成树问题是有效的。
This paper presents an optimization model of virtual design for project search tree problem, which can be solved by using the characteristic artificial neural net.
针对虚拟设计中的方案树搜索树问题提出一种新的优化模型，并结合人工神经网络技术加以解决。
Algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.
算法设计与分析的经典程序，主要有0 - 1背包问题，最小生成树等。
Algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.
算法设计与分析的经典程序，主要有0 - 1背包问题，最小生成树等。
应用推荐