91 search results - page 3 / 19 » A dynamic inequality generation scheme for polynomial progra... |
DAC
2009
ACM
14 years 7 months ago
2009
ACM
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
STOC
1999
ACM
13 years 10 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
ICALP
2000
Springer
13 years 10 months ago
2000
Springer
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
ICCAD
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
ENTCS
2010
13 years 6 months ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...