Using Bees to Solve a Data-Mining Problem Expressed as a Max-Sat One.
Karima BenatchbaLotfi AdmaneMouloud KoudilPublished in: IWINAC (2) (2005)
Keyphrases
- max sat
- weighted max sat
- data mining
- lower bound
- finding optimal solutions
- tabu search
- branch and bound algorithm
- branch and bound
- sat solvers
- sat problem
- search algorithm
- maximum satisfiability
- constraint satisfaction problems
- boolean satisfiability
- neural network
- satisfiability problem
- stochastic local search
- unsatisfiable cores