Sciweavers

220 search results - page 42 / 44
» Minimizing Average Flow-time : Upper and Lower Bounds
Sort
View
JSAC
2008
76views more  JSAC 2008»
13 years 7 months ago
Rate-Based Equilibria in Collision Channels with Fading
We consider a wireless collision channel, shared by a finite number of users who transmit to a common base station. Each user wishes to minimize its average transmission rate (or p...
Ishai Menache, Nahum Shimkin
IPSN
2005
Springer
14 years 25 days ago
Towards optimal sleep scheduling in sensor networks for rare-event detection
— Lifetime maximization is one key element in the design of sensor-network-based surveillance applications. We propose a protocol for node sleep scheduling that guarantees a boun...
Qing Cao, Tarek F. Abdelzaher, Tian He, John A. St...
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 11 months ago
The Bethe Permanent of a Non-Negative Matrix
:  The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
Pascal O. Vontobel
ALGOSENSORS
2009
Springer
14 years 1 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
ISTCS
1997
Springer
13 years 11 months ago
Exact Analysis of Exact Change
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
Pat Frankel