Towards Massively Parallel Local Search for SAT - (Poster Presentation).
Alejandro ArbelaezPhilippe CodognetPublished in: SAT (2012)
Keyphrases
- massively parallel
- stochastic local search
- propositional satisfiability
- search algorithm
- satisfiability testing
- poster presentation
- sat solvers
- satisfiability problem
- fine grained
- search procedures
- search space
- high performance computing
- sat problem
- parallel computing
- genetic algorithm
- search strategies
- program committee
- tabu search
- invited talk
- acceptance rate
- parallel architectures
- max sat
- sat instances
- simulated annealing
- optimal solution
- parallel machines
- knowledge discovery and data mining
- accepted papers
- phase transition
- review process
- data mining
- oral presentation
- databases