Sciweavers

486 search results - page 94 / 98
» Improved upper bounds for 3-SAT
Sort
View
FOCS
2009
IEEE
14 years 3 months ago
Choice-Memory Tradeoff in Allocations
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...
Noga Alon, Eyal Lubetzky, Ori Gurel-Gurevich
ALGOSENSORS
2009
Springer
14 years 3 months ago
Near-Optimal Radio Use for Wireless Network Synchronization
In this paper we consider the model of communication where wireless devices can either switch their radios off to save energy (and hence, can neither send nor receive messages), o...
Milan Bradonjic, Eddie Kohler, Rafail Ostrovsky
ESA
2009
Springer
99views Algorithms» more  ESA 2009»
14 years 3 months ago
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
We consider online algorithms for pull-based broadcast scheduling. In this setting there are n pages of information at a server and requests for pages arrive online. When the serv...
Chandra Chekuri, Sungjin Im, Benjamin Moseley
ISCA
2007
IEEE
149views Hardware» more  ISCA 2007»
14 years 2 months ago
Virtual private caches
Virtual Private Machines (VPM) provide a framework for Quality of Service (QoS) in CMP-based computer systems. VPMs incorporate microarchitecture mechanisms that allow shares of h...
Kyle J. Nesbit, James Laudon, James E. Smith
BTW
2007
Springer
154views Database» more  BTW 2007»
14 years 2 months ago
Integrating Query-Feedback Based Statistics into Informix Dynamic Server
: Statistics that accurately describe the distribution of data values in the columns of relational tables are essential for effective query optimization in a database management sy...
Alexander Behm, Volker Markl, Peter J. Haas, Kesha...