313 search results - page 8 / 63 » Complete Local Search with Memory |
AAAI
2000
13 years 11 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
AI
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We present a new hybrid constraint solving schema which retains some systematicity of constructive search while incorporating the heuristic guidance and lack of commitmen...
TAINN
2005
Springer
14 years 3 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
ECAI
2008
Springer
13 years 11 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
SIGIR
2003
ACM
14 years 3 months ago
2003
ACM
As a result of the anonymity in todays Web search, it is not possible to receive a personalized search result. Neither prior search results nor search results from other users are ...