-
1 searching tree
дерево поиска; дерево перебораButtonwood Tree Agreement — " Соглашение платанового дерева"
-
2 searching tree
Большой англо-русский и русско-английский словарь > searching tree
-
3 searching tree
Вычислительная техника: дерево перебора, дерево поиска -
4 searching tree
дерево перебора, дерево поиска
-
5 searching tree
дерево поиска; дерево перебора -
6 tree
1) дерево2) бревно3) стойка, подпорка7) мн. ч. дендритные образования (напр. на пластинах аккумулятора)•-
balanced tree
-
binary tree
-
Boolean tree
-
branching tree
-
Christmas tree
-
code tree
-
decision tree
-
derivation tree
-
document tree
-
dormant tree
-
dual completion Christmas tree
-
flange-type Christmas tree
-
game tree
-
garment tree
-
graph tree
-
head tree
-
informational tree
-
loose-valve Christmas tree
-
marine Christmas tree
-
multiple completion Christmas tree
-
oriented tree
-
overlay tree
-
plane tree
-
platform Christmas tree
-
production tree
-
random tree
-
rooted tree
-
root tree
-
searching tree
-
search tree
-
selection tree
-
sink tree
-
solid-block valve Christmas tree
-
spanning tree
-
subsea test tree
-
thread-type Christmas tree
-
underwater Christmas tree -
7 tree
1) древовидная схема, дерево; древовидный дешифратор2) т.граф. дерево•- and-or tree
- AVL-tree
- balanced tree
- binary tree
- Boolean tree
- clock tree
- cluster tree
- collapsed tree
- decision tree
- depth-balanced tree
- derivation tree
- directed tree
- directory tree
- edge-valued binary decision tree
- exclusive tree
- expanded tree
- fan-out tree
- fault tree
- folded tree
- game tree
- height-balanced tree
- hierarchical tree
- inclusive tree
- incremented tree
- inverted tree
- Lupanov's tree
- minimum length tree
- N-bit parity tree
- overlay tree
- parity tree
- pattern tree
- position tree
- production tree
- radix tree
- rooted tree
- scope tree
- searching tree
- search tree
- selection tree
- shalloow tree
- sink tree
- skewed tree
- spanning tree
- specification tree
- syntactic tree
- syntax tree
- undirected tree
- upside down tree
- VLSI search tree
- word-level decision tree
- XOR treeEnglish-Russian dictionary of computer science and programming > tree
-
8 searching
1) поиск2) исследование; изучение•- nearest neighbor searching
- path searching
- shortest path searching
- tree searching -
9 searching
1) поиск2) исследование; изучение•- nearest neighbor searching
- path searching
- shortest path searching
- tree searchingThe New English-Russian Dictionary of Radio-electronics > searching
-
10 searching for
ищущий; поискsearching tree — дерево поиска; дерево перебора
-
11 searching for
The English-Russian dictionary general scientific > searching for
-
12 tree searching
Программирование: поиск по дереву -
13 tree searching game
Математика: игра поиск на дереве, игра "поиск по дереву" -
14 tree searching
-
15 tree searching
The New English-Russian Dictionary of Radio-electronics > tree searching
-
16 tree searching game
игра "поиск по дереву" -
17 random searching
searching tree — дерево поиска; дерево перебора
The English-Russian dictionary general scientific > random searching
-
18 keyword searching
searching tree — дерево поиска; дерево перебора
English-Russian dictionary of Information technology > keyword searching
-
19 binary tree searching
Математика: поиск по бинарному дереву -
20 производивший поиск
дерево поиска; дерево перебора — searching tree
Авиация и космонавтика. Русско-английский словарь > производивший поиск
См. также в других словарях:
Tree rearrangement — Tree rearrangements are used in heuristic algorithms devoted to searching for an optimal tree structure. They can be applied to any set of data that are naturally arranged into a tree, but have most applications in computational phylogenetics,… … Wikipedia
Searching — and search can refer to the following:In computing and mathematics, * Search algorithm, an algorithm taking a problem as input and returning a solution to the problem, usually after evaluating a number of possible solutions * Bayesian search… … Wikipedia
Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
Tree decomposition — A graph with eight vertices, and a tree decomposition of it onto a tree with six nodes. Each graph edge connects two vertices that are listed together at some tree node, and each graph vertex is listed at the nodes of a contiguous subtree of the… … Wikipedia
R-tree — R trees are tree data structures that are similar to B trees, but are used for spatial access methods i.e., for indexing multi dimensional information; for example, the (X, Y) coordinates of geographical data. A common real world usage for an R… … Wikipedia
Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… … Wikipedia
The Joshua Tree — For other uses, see Joshua tree (disambiguation). The Joshua Tree … Wikipedia
Suffix tree — In computer science, a suffix tree (also called suffix trie, PAT tree or, in an earlier form, position tree) is a data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many… … Wikipedia
Kd-tree — In computer science, a k d tree (short for k dimensional tree ) is a space partitioning data structure for organizing points in a k dimensional space. k d trees are a useful data structure for several applications, such as searches involving a… … Wikipedia
Decision tree model — In computational complexity and communication complexity theories the decision tree model is the model of computation or communication in which an algorithm or communication process is considered to be basically a decision tree, i.e., a sequence… … Wikipedia
And–or tree — An and–or tree is a graphical representation of the reduction of problems (or goals) to conjunctions and disjunctions of sub problems (or sub goals). ExampleThe and or tree:represents the search space for solving the problem P, using the goal… … Wikipedia