2343 search results - page 51 / 469 » Visual-Concept Search Solved |
AAAI
2010
15 years 2 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
110
click to vote
CPAIOR
2006
Springer
15 years 3 months ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
111
click to vote
CP
2005
Springer
15 years 6 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
AAAI
2007
15 years 3 months ago
2007
Russian Doll Search (RDS) is a well-known algorithm for combinatorial optimization. In this paper we extend it from mono-objective to multi-objective optimization. We demonstrate ...
178
click to vote
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...