3514 search results - page 3 / 703 » A search space |
AAAI
2007
13 years 10 months ago
2007
In a constraint optimization problem (COP), many feasible valuations lead to the same objective value. This often means a huge search space and poor performance in the propagation...
ICML
1994
IEEE
13 years 11 months ago
1994
IEEE
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
CP
2009
Springer
14 years 8 months ago
2009
Springer
Many problems require minimally perturbing an initial state in order to repair some violated constraints. We consider two search spaces for exactly solving this minimal perturbatio...
ICTAI
1999
IEEE
13 years 12 months ago
1999
IEEE
Recently there has been significant progress in our understanding of the computational nature of combinatorial problems. Randomized search methods, both complete and incomplete, o...
AROBOTS
2008
13 years 7 months ago
2008
This paper presents a technique for dynamically reconfiguring search spaces in order to enable Bayesian autonomous search and tracking missions with moving targets. In particular, ...