Login / Signup
A comparative study of two Boolean formulations of FPGA detailed routing constraints.
Gi-Joon Nam
Fadi A. Aloul
Karem A. Sakallah
Rob A. Rutenbar
Published in:
ISPD (2001)
Keyphrases
</>
real time
real world
high speed
global constraints
boolean constraints
miller tucker zemlin
constraint satisfaction
network topology
shortest path
geometric constraints
constrained optimization
routing problem
hardware architecture