Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems.
Carla P. GomesBart SelmanKen McAloonCarol TretkoffPublished in: AIPS (1998)
Keyphrases
- solving hard
- heavy tailed
- backtrack search
- scheduling problem
- combinatorial problems
- propositional satisfiability
- satisfiability problem
- search problems
- propositional logic
- stochastic local search
- constraint satisfaction problems
- constraint programming
- constraint satisfaction
- sat problem
- np hard
- sat solvers
- generalized gaussian
- branch and bound algorithm
- search algorithm
- orders of magnitude
- tabu search
- np complete
- phase transition
- combinatorial optimization
- metaheuristic
- highly efficient
- automated reasoning
- prior distribution
- traveling salesman problem
- industrial applications
- optimal solution
- search strategies
- heuristic search
- global constraints
- max sat
- belief revision