Sciweavers

3208 search results - page 153 / 642
» A Lower Bound for Primality
Sort
View
COCOON
2007
Springer
16 years 19 days ago
Online Interval Scheduling: Randomized and Multiprocessor Cases
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zhen...
WADS
2007
Springer
96views Algorithms» more  WADS 2007»
16 years 17 days ago
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
Abstract. Assumptions about node density in the Sensor Networks literature are frequently too strong or too weak. Neither absolutely arbitrary nor uniform deployment seem feasible ...
Martin Farach-Colton, Miguel A. Mosteiro
ESA
2001
Springer
110views Algorithms» more  ESA 2001»
15 years 11 months ago
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults. Concerning oblivious fault-tolerant dist...
Andrea E. F. Clementi, Angelo Monti, Riccardo Silv...
ICCAD
1998
IEEE
64views Hardware» more  ICCAD 1998»
15 years 10 months ago
Energy-efficiency in presence of deep submicron noise
Presented in this paper are 1) information-theoretic lower bounds on energy consumption of noisy digital gates and 2) the concept of noise tolerance via coding for achieving energy...
Rajamohana Hegde, Naresh R. Shanbhag
WDAG
1994
Springer
104views Algorithms» more  WDAG 1994»
15 years 10 months ago
Fast Increment Registers
We give an optimal, wait-free implementation of an increment register. An increment register is a concurrent object consisting of an integer-valued register with an increment oper...
Soma Chaudhuri, Mark R. Tuttle