Sciweavers

681 search results - page 16 / 137
» Searching with expectations
Sort
View
JAIR
2007
106views more  JAIR 2007»
14 years 11 months ago
Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins...
J. Christopher Beck
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
15 years 5 months ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...
ALGORITHMICA
2011
14 years 6 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
AAAI
2006
15 years 1 months ago
Improve Web Search Using Image Snippets
The Web has become the largest information repository over the world. Therefore, effectively and efficiently searching the Web becomes a key challenge. Previous research on Web se...
Xiao-Bing Xue, Zhi-Hua Zhou, Zhongfei (Mark) Zhang
FOCS
2008
IEEE
15 years 6 months ago
The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well)
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...
Michael Ben-Or, Avinatan Hassidim