310 search results - page 47 / 62 » Randomized Binary Search Trees |
ALGORITHMICA
2005
13 years 9 months ago
2005
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...
EMO
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In engineering and other ‘real-world’ applications, multiobjective optimization problems must frequently be tackled on a tight evaluation budget — tens or hundreds ...
SODA
2012
ACM
12 years 10 days ago
2012
ACM
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
GECCO
2000
Springer
14 years 1 months ago
2000
Springer
During chemical reactions, molecules interact to produce new molecules. Some of the reaction mechanisms are very close to the way gene combine to produce new genes. Like the class...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
We propose a more robust robot programming by demonstration system planner that produces a reproduction path which satisfies statistical constraints derived from demonstration traj...