435 search results - page 22 / 87 » Partitioning Search Spaces of a Randomized Search |
IJAIT
2002
14 years 9 months ago
2002
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...
CEC
2009
IEEE
14 years 7 months ago
2009
IEEE
This paper studies the difference between Persistent Random Constants (PRC) and Digit Concatenation as methods for generating constants. It has been shown that certain problems hav...
PCM
2001
Springer
15 years 2 months ago
2001
Springer
A practical method for creating a high dimensional index structure that adapts to the data distribution and scales well with the database size, is presented. Typical media descrip...
SISAP
2009
IEEE
15 years 4 months ago
2009
IEEE
—We introduce a novel metric space search data structure called EGNAT, which is fully dynamic and designed for secondary memory. The EGNAT is based on Brin’s GNAT static index,...
102
click to vote
CONSTRAINTS
2010
14 years 9 months ago
2010
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...