Cooperative Bees Swarm for Solving the Maximum Weighted Satisfiability Problem.
Habiba DriasSouhila SadegSafa YahiPublished in: IWANN (2005)
Keyphrases
- satisfiability problem
- cooperative
- solving hard
- stochastic local search
- sat instances
- swarm intelligence
- temporal logic
- np complete
- finite domain
- search algorithm
- phase transition
- weighted max sat
- sat problem
- graph coloring problems
- pspace complete
- stochastic local search algorithms
- davis putnam logemann loveland
- systematic search algorithms
- particle swarm optimization
- max sat
- random sat
- decision procedures
- constraint satisfaction
- model checking
- constraint satisfaction problems