A Comparative Study of Two Boolean Formulations of FPGA Detailed Routing Constraints.
Gi-Joon NamFadi A. AloulKarem A. SakallahRob A. RutenbarPublished in: IEEE Trans. Computers (2004)
Keyphrases
- constraint satisfaction
- real valued
- miller tucker zemlin
- high speed
- routing algorithm
- network topology
- real time image processing
- mobile ad hoc networks
- constrained optimization
- end to end
- low cost
- ad hoc networks
- real time
- geometric constraints
- routing protocol
- linear constraints
- valid inequalities
- hardware design
- network topologies
- evolutionary algorithm
- boolean constraints
- neural network