438 search results - page 7 / 88 » A Theory of Competitive Analysis for Distributed Algorithms |
TPDS
2010
13 years 5 months ago
2010
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The phenomenon of particle bursts, a well-known feature of PSO is investigated. Their origin is concluded to lie in multiplicative stochasticity, previously encountered in the stu...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
This paper deals with clustering of spatially distributed data using wireless sensor networks. A distributed low-complexity clustering algorithm is developed that requires one-hop...
DSD
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—In two recent contributions [1], [2], we have provided a comparative analysis of various optimization algorithms, which can be used for atomic location estimation, and s...
CP
2004
Springer
14 years 23 days ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...