Exploitation of Parallel Search Space Evaluation with FPGAs in Combinatorial Problems: The Eternity II Case.
Pavlos MalakonakisApostolos DollasPublished in: FPL (2011)
Keyphrases
- combinatorial problems
- search space
- metaheuristic
- constraint satisfaction problems
- constraint programming
- combinatorial search
- combinatorial optimization
- constraint satisfaction
- graph coloring
- branch and bound algorithm
- search algorithm
- traveling salesman problem
- phase transition
- solving hard
- simulated annealing
- specific problems
- parallel architectures
- optimal solution
- branch and bound
- optimization problems
- neural network
- constraint propagation
- heuristic search
- ant colony optimization
- tabu search
- hard combinatorial optimization problems
- graph colouring