5316 search results - page 81 / 1064 » Which Search Problems Are Random |
102
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
79
Voted
PR
2008
15 years 1 months ago
2008
In this paper, we present a new background estimation algorithm which effectively represents both background and foreground. The problem is formulated with a labeling problem over...
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
125
Voted
TIME
2002
IEEE
15 years 6 months ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
97
Voted
ICMCS
2005
IEEE
15 years 6 months ago
2005
IEEE
Random geometric distortion is one of the most difficult kinds of image processing to survive and has been a noted problem in watermarking research. Previous methods for dealing ...