Sciweavers

9716 search results - page 38 / 1944
» The Case for Energy-Proportional Computing
Sort
View
FOCS
2003
IEEE
15 years 3 months ago
On Worst-Case to Average-Case Reductions for NP Problems
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...
Andrej Bogdanov, Luca Trevisan
ICCSA
2010
Springer
14 years 8 months ago
Further Results on Swarms Solving Graph Coloring
Manuel Graña, Blanca Cases, Carmen Hern&aac...
CDC
2009
IEEE
196views Control Systems» more  CDC 2009»
14 years 7 months ago
A computational stability analysis of discrete-time piecewise linear systems
A computational method for stability analysis of discrete-time piecewise linear systems is presented. The method is based on combining the solutions to two separate problems: one i...
Satyajit Arivukkodi Krishnamurthy, Ji-Woong Lee
EOR
2002
68views more  EOR 2002»
14 years 9 months ago
The computational complexity of the criticality problems in a network with interval activity times
The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) ...
Stefan Chanas, Pawel Zielinski
JSC
2010
99views more  JSC 2010»
14 years 8 months ago
Faster algorithms for computing Hong's bound on absolute positiveness
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
Kurt Mehlhorn, Saurabh Ray