A Polynomial-Time Solution to Constraint Satisfaction Problems by Neural-like P Systems.
Lei XuXiangxiang ZengPeter JeavonsPublished in: Int. J. Unconv. Comput. (2013)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- constraint problems
- np complete
- constraint programming
- constraint solvers
- optimal solution
- graph coloring problems
- configuration problems
- computational problems
- pseudo boolean optimization
- backtracking algorithm
- non binary
- combinatorial problems
- constraint networks
- np hard
- symmetry breaking
- constraint solving
- reasoning problems
- upper bound
- partial constraint satisfaction
- dynamic constraint satisfaction problems