3514 search results - page 3 / 703 » A search space |
103
Voted
AAAI
2007
15 years 3 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...
126
click to vote
ICML
1994
IEEE
15 years 4 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 ...
172
Voted
CP
2009
Springer
16 years 1 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
15 years 5 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...
105
Voted
AROBOTS
2008
15 years 25 days 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, ...