Sciweavers

2924 search results - page 584 / 585
» Lower Bounds in Distributed Computing
Sort
View
CCE
2004
13 years 6 months ago
Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
José María Ponce-Ortega, Vicente Ric...
AI
1998
Springer
13 years 6 months ago
Methods for Task Allocation via Agent Coalition Formation
Task execution in multi-agent environments may require cooperation among agents. Given a set of agents and a set of tasks which they have to satisfy, we consider situations where ...
Onn Shehory, Sarit Kraus
TMC
2010
142views more  TMC 2010»
13 years 5 months ago
DGRAM: A Delay Guaranteed Routing and MAC Protocol for Wireless Sensor Networks
This paper presents an integrated MAC and routing protocol called Delay Guaranteed Routing and MAC (DGRAM) for delay sensitive wireless sensor network (WSN) applications. DGRAM is...
Shanti Chilukuri, Anirudha Sahoo
TON
2010
147views more  TON 2010»
13 years 5 months ago
Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
Tao Shu, Marwan Krunz
ASIACRYPT
2011
Springer
12 years 6 months ago
Leakage-Resilient Cryptography from the Inner-Product Extractor
We present a generic method to secure various widely-used cryptosystems against arbitrary side-channel leakage, as long as the leakage adheres three restrictions: first, it is bou...
Stefan Dziembowski, Sebastian Faust