Sciweavers

657 search results - page 6 / 132
» Polynomial Time Algorithms for Minimum Energy Scheduling
Sort
View
STOC
1996
ACM
132views Algorithms» more  STOC 1996»
15 years 1 months ago
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woegi...
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
15 years 6 months ago
A polynomial time approximation scheme for timing constrained minimum cost layer assignment
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
Shiyan Hu, Zhuo Li, Charles J. Alpert
SAT
2007
Springer
129views Hardware» more  SAT 2007»
15 years 3 months ago
Minimum 2CNF Resolution Refutations in Polynomial Time
We present an algorithm for finding a smallest Resolution refutation of any 2CNF in polynomial time.
Joshua Buresh-Oppenheim, David G. Mitchell
EMMCVPR
2001
Springer
15 years 2 months ago
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
Yuri Boykov, Vladimir Kolmogorov
ADHOC
2007
122views more  ADHOC 2007»
14 years 9 months ago
Minimum latency joint scheduling and routing in wireless sensor networks
Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient ...
Gang Lu, Bhaskar Krishnamachari