Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP.
David AlloucheSimon de GivryThomas SchiexPublished in: CP (2010)
Keyphrases
- solving hard
- dynamic programming
- combinatorial problems
- constraint satisfaction problems
- sat problem
- search problems
- satisfiability problem
- constraint programming
- constraint satisfaction
- stochastic local search
- propositional logic
- np complete
- propositional satisfiability
- backtrack search
- graph coloring
- particle swarm optimization
- constraint propagation
- branch and bound algorithm
- sat instances
- arc consistency
- neural network
- branch and bound
- combinatorial optimization
- orders of magnitude
- state space
- search space
- computational complexity
- genetic algorithm