1376 search results - page 12 / 276 » Searching Trees: An Essay |
109
click to vote
ANTSW
2004
Springer
15 years 5 months ago
2004
Springer
Constructive metaheuristics explore a tree of constructive decisions, the topology of which is determined by the way solutions are represented and constructed. Some solution repres...
100
click to vote
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
116
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
106
click to vote
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
103
click to vote
CORR
2004
Springer
14 years 11 months ago
2004
Springer
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...