213 search results - page 18 / 43 » An Approximation Algorithm for Binary Searching in Trees |
148
click to vote
WADS
2009
Springer
15 years 9 months ago
2009
Springer
Since the invention of AVL trees in 1962, a wide variety of ways to balance binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing afte...
126
click to vote
OPODIS
2004
15 years 4 months ago
2004
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
128
click to vote
AAAI
2010
15 years 4 months ago
2010
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian...
139
click to vote
ICMCS
2009
IEEE
15 years 28 days ago
2009
IEEE
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
128
click to vote
EOR
2008
15 years 3 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...