4 search results - page 1 / 1 » On Universal Restart Strategies for Backtracking Search |
CP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
CSCLP
2004
Springer
14 years 6 days ago
2004
Springer
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
CEC
2011
IEEE
12 years 6 months ago
2011
IEEE
—We develop a stochastic local search algorithm for finding Pareto points for multi-criteria optimization problems. The algorithm alternates between different single-criterium o...
PRICAI
2004
Springer
14 years 5 days ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...