Sciweavers

1469 search results - page 173 / 294
» A New Migration Model For Distributed Genetic Algorithms
Sort
View
PODC
2010
ACM
13 years 12 months ago
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
We define two new classes of shared-memory objects: ratifiers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...
James Aspnes
WDAG
2007
Springer
92views Algorithms» more  WDAG 2007»
14 years 2 months ago
Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
Abstract. Distributed computing must adapt its techniques to networks of mobile agents. Indeed, we are facing new problems like the small size of memory and the lack of computation...
Joffroy Beauquier, Julien Clement, Stéphane...
COLCOM
2009
IEEE
14 years 24 days ago
Unified analytical models for Location Management costs and optimum design of location areas
—Within collaborative computing, computer mediated communications are evolving rapidly thanks to the development of new technologies. The facilitation of awareness and discovery ...
Eladio Martin, Ling Liu, Matt Weber, Péter ...
ICRA
2006
IEEE
165views Robotics» more  ICRA 2006»
14 years 2 months ago
Biped Gait Optimization using Spline Function based Probability Model
— A new Estimation of Distribution Algorithm (EDA) with spline kernel function (EDA_S) is proposed to optimize biped gait for a nine-link humanoid robot. Gait synthesis of the bi...
Lingyun Hu, Changjiu Zhou, Zengqi Sun
PPOPP
2009
ACM
14 years 8 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader