Solving Hard Stable Matching Problems via Local Search and Cooperative Parallelization.
Danny MuneraDaniel DiazSalvador AbreuFrancesca RossiVijay A. SaraswatPhilippe CodognetPublished in: AAAI (2015)
Keyphrases
- cooperative
- solving hard
- stochastic local search
- search problems
- propositional satisfiability
- satisfiability problem
- combinatorial problems
- search algorithm
- natural language
- sat problem
- scheduling problem
- np complete
- orders of magnitude
- cellular automata
- utility function
- combinatorial optimization
- genetic algorithm