Sciweavers

1983 search results - page 67 / 397
» Optimal Reverse-Pricing Mechanisms
Sort
View
TCS
2002
15 years 11 days ago
Asymptotic behavior in a heap model with two pieces
In a heap model, solid blocks, or pieces, pile up according to the Tetris game mechanism. An optimal schedule is an in nite sequence of pieces minimizing the asymptotic growth rat...
Jean Mairesse, Laurent Vuillon
INFOCOM
2010
IEEE
14 years 11 months ago
Making the Case for Random Access Scheduling in Wireless Multi-hop Networks
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
Apoorva Jindal, Ann Arbor, Konstantinos Psounis
CISS
2008
IEEE
15 years 7 months ago
Imperfect randomized algorithms for the optimal control of wireless networks
Abstract— We consider a joint randomized scheduling, congestion control mechanism for general wireless networks. We allow for a set of imperfections in the operation of the rando...
Atilla Eryilmaz, Asuman E. Ozdaglar, Devavrat Shah...
84
Voted
ICDIM
2007
IEEE
15 years 7 months ago
Optimized contextual discovery of Web Services for Devices
Due to more and more mobile computers moving among smart and communicating devices in our everyday life, we observe the emergence of new constraints in software design. Indeed, de...
Nicolas Bussiere, Daniel Cheung-Foo-Wo, Vincent Ho...
97
Voted
ICDCS
1996
IEEE
15 years 4 months ago
How to Recover Efficiently and Asynchronously when Optimism Fails
We propose a new algorithm for recovering asynchronously from failures in a distributed computation. Our algorithm is based on two novel concepts - a fault-tolerant vector clock t...
Om P. Damani, Vijay K. Garg