1578 search results - page 51 / 316 » Direct Routing: Algorithms and Complexity |
153
click to vote
APPROX
2010
Springer
15 years 3 months ago
2010
Springer
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
114
click to vote
ICCAD
2007
IEEE
15 years 11 months ago
2007
IEEE
— The orientation of a bus is defined as the direction from the Least Significant Bit (LSB) to the Most Significant Bit (MSB). Bused pin flipping is a property that allows severa...
119
click to vote
LATIN
2010
Springer
15 years 9 months ago
2010
Springer
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
119
click to vote
WG
2010
Springer
15 years 21 days ago
2010
Springer
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...
115
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...