Sciweavers

355 search results - page 32 / 71
» Asynchronous distributed optimization with minimal communica...
Sort
View
PODC
2011
ACM
12 years 10 months ago
The complexity of robust atomic storage
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
Dan Dobre, Rachid Guerraoui, Matthias Majuntke, Ne...
ICDCSW
2005
IEEE
14 years 1 months ago
iMobif: An Informed Mobility Framework for Energy Optimization in Wireless Ad Hoc Networks
Recent research results show that a wireless ad hoc network can exploit controlled node mobility to reduce communication energy consumption. Node movement, however, may consume a ...
Chiping Tang, Philip K. McKinley
NPL
1998
133views more  NPL 1998»
13 years 7 months ago
Parallel Coarse Grain Computing of Boltzmann Machines
Abstract. The resolution of combinatorial optimization problems can greatly benefit from the parallel and distributed processing which is characteristic of neural network paradigm...
Julio Ortega, Ignacio Rojas, Antonio F. Día...
IAT
2009
IEEE
14 years 2 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
SOFSEM
2010
Springer
14 years 4 months ago
Parallel Randomized Load Balancing: A Lower Bound for a More General Model
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
Guy Even, Moti Medina