Sciweavers

28962 search results - page 5621 / 5793
» Computational Mechanism Design
Sort
View
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
16 years 6 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
16 years 6 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
OSDI
2002
ACM
16 years 6 months ago
Vertigo: Automatic Performance-Setting for Linux
Combining high performance with low power consumption is becoming one of the primary objectives of processor designs. Instead of relying just on sleep mode for conserving power, a...
Krisztián Flautner, Trevor N. Mudge
ICALP
2009
Springer
16 years 6 months ago
Sleep with Guilt and Work Faster to Minimize Flow Plus Energy
In this paper we extend the study of flow-energy scheduling to a model that allows both sleep management and speed scaling. Our main result is a sleep management algorithm called I...
Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Isaac Ka...
SIGMOD
2009
ACM
122views Database» more  SIGMOD 2009»
16 years 6 months ago
Finding min-repros in database software
Testing and debugging database system applications is often challenging and time consuming. A database tester (or DB tester for short) has to detect a problem, determine why it ha...
Nicolas Bruno, Rimma V. Nehme
« Prev « First page 5621 / 5793 Last » Next »