Sciweavers

414 search results - page 12 / 83
» Integer Linear Programming Models for Global Routing
Sort
View
CN
2006
75views more  CN 2006»
14 years 9 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon
MP
2007
95views more  MP 2007»
14 years 9 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
GLVLSI
1996
IEEE
125views VLSI» more  GLVLSI 1996»
15 years 1 months ago
Performance-Driven Interconnect Global Routing
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
Dongsheng Wang, Ernest S. Kuh
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
15 years 4 months ago
Integer Polyhedra for Program Analysis
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
Philip J. Charles, Jacob M. Howe, Andy King
NAACL
2007
14 years 11 months ago
Joint Determination of Anaphoricity and Coreference Resolution using Integer Programming
Standard pairwise coreference resolution systems are subject to errors resulting from their performing anaphora identification as an implicit part of coreference resolution. In t...
Pascal Denis, Jason Baldridge