5316 search results - page 56 / 1064 » Which Search Problems Are Random |
HEURISTICS
2008
15 years 25 days ago
2008
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
111
Voted
SLS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
130
click to vote
EDBT
2010
ACM
15 years 4 months ago
2010
ACM
Recently, there has been growing interest in random sampling from online hidden databases. These databases reside behind form-like web interfaces which allow users to execute sear...
118
Voted
AAAI
1996
15 years 2 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
109
click to vote
SIAMCOMP
1998
15 years 13 days ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...