Solving hard instances of FPGA routing with a congestion-optimal restrained-norm path search space.
Keith SoPublished in: ISPD (2007)
Keyphrases
- solving hard
- search problems
- search space
- combinatorial problems
- stochastic local search
- satisfiability problem
- propositional satisfiability
- optimal solution
- packet transmission
- metaheuristic
- search algorithm
- sat solvers
- propositional logic
- shortest path
- heuristic search
- constraint satisfaction problems
- orders of magnitude
- optimal path
- sat problem
- dynamic programming
- link failure
- dynamic routing
- search strategy
- ad hoc networks
- constraint programming
- objective function
- branch and bound
- np complete
- np hard
- routing protocol