3055 search results - page 326 / 611 » Randomized Search Trees |
166
Voted
CP
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
170
click to vote
MIDDLEWARE
2004
Springer
16 years 4 hour ago
2004
Springer
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...
172
click to vote
CONSTRAINTS
2006
15 years 6 months ago
2006
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
186
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Abstract. The estimation of the epipolar geometry is especially difficult where the putative correspondences include a low percentage of inlier correspondences and/or a large subse...
145
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...