3055 search results - page 64 / 611 » Randomized Search Trees |
110
click to vote
SODA
1993
ACM
15 years 2 months ago
1993
ACM
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
118
click to vote
CPHYSICS
2006
15 years 1 months ago
2006
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
129
click to vote
STACS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
CEC
2007
IEEE
15 years 3 months ago
2007
IEEE
— Efficient discovery of lowest level building blocks is a fundamental requirement for a successful genetic algorithm. Although considerable effort has been directed at techniqu...
100
click to vote
ISCA
2008
IEEE
15 years 1 months ago
2008
IEEE
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...