Sciweavers

2 search results - page 1 / 1
» FPGA Routing and Routability Estimation via Boolean Satisfia...
Sort
View
DATE
2008
IEEE
105views Hardware» more  DATE 2008»
13 years 11 months ago
Comparison of Boolean Satisfiability Encodings on FPGA Detailed Routing Problems
We compare 12 new encodings for representing of FPGA detailed routing problems as equivalent Boolean Satisfiability (SAT) problems against the only 2 previously used encodings. We...
Miroslav N. Velev, Ping Gao 0002