Sciweavers

3415 search results - page 547 / 683
» Lower Bounds for Kernelizations
Sort
View
PLDI
2003
ACM
15 years 9 months ago
The design, implementation, and evaluation of a compiler algorithm for CPU energy reduction
This paper presents the design and implementation of a compiler algorithm that effectively optimizes programs for energy usage using dynamic voltage scaling (DVS). The algorithm ...
Chung-Hsing Hsu, Ulrich Kremer
PODC
2003
ACM
15 years 9 months ago
Scalable and dynamic quorum systems
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
Moni Naor, Udi Wieder
SIGECOM
2003
ACM
107views ECommerce» more  SIGECOM 2003»
15 years 9 months ago
Using value queries in combinatorial auctions
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...
Benoît Hudson, Tuomas Sandholm
SPAA
2003
ACM
15 years 9 months ago
Asynchronous parallel disk sorting
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
Roman Dementiev, Peter Sanders
CP
2003
Springer
15 years 9 months ago
Generating High Quality Schedules for a Spacecraft Memory Downlink Problem
This work introduces a combinatorial optimization problem called Mars Express Memory Dumping Problem (Mex-Mdp), which arises in the European Space Agency program Mars Express. It c...
Angelo Oddi, Nicola Policella, Amedeo Cesta, Gabri...