Sciweavers

3049 search results - page 122 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
173
Voted
SIROCCO
2010
15 years 6 months ago
Algorithms for Extracting Timeliness Graphs
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
Carole Delporte-Gallet, Stéphane Devismes, ...
136
Voted
GLOBECOM
2006
IEEE
15 years 10 months ago
Bounds on the Lifetime of Wireless Sensor Networks Employing Multiple Data Sinks
Abstract—Employing multiple base stations is an attractive approach to enhance the lifetime of wireless sensor networks. In this paper, we address the fundamental question concer...
Amar P. Azad, Ananthanarayanan Chockalingam
147
Voted
ICASSP
2008
IEEE
15 years 11 months ago
Stability analysis of the consensus-based distributed LMS algorithm
We deal with consensus-based online estimation and tracking of (non-) stationary signals using ad hoc wireless sensor networks (WSNs). A distributed (D-) least-mean square (LMS) l...
Ioannis D. Schizas, Gonzalo Mateos, Georgios B. Gi...
161
Voted
ISICA
2007
Springer
15 years 10 months ago
Fast Multi-swarm Optimization with Cauchy Mutation and Crossover Operation
The standard Particle Swarm Optimization (PSO) algorithm is a novel evolutionary algorithm in which each particle studies its own previous best solution and the group’s previous ...
Qing Zhang, Changhe Li, Yong Liu, Lishan Kang
124
Voted
IOR
2007
119views more  IOR 2007»
15 years 4 months ago
A Decentralized Approach to Discrete Optimization via Simulation: Application to Network Flow
We study a new class of decentralized algorithms for discrete optimization via simulation, which is inspired by the fictitious play algorithm applied to games with identical inte...
Alfredo Garcia, Stephen D. Patek, Kaushik Sinha