Sciweavers

7648 search results - page 75 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
IPSN
2004
Springer
15 years 3 months ago
Locally constructed algorithms for distributed computations in ad-hoc networks
In this paper we develop algorithms for distributed computation of a broad range of estimation and detection tasks over networks with arbitrary but fixed connectivity. The distri...
Dzulkifli S. Scherber, Haralabos C. Papadopoulos
GECCO
2005
Springer
101views Optimization» more  GECCO 2005»
15 years 3 months ago
Measuring mobility and the performance of global search algorithms
The global search properties of heuristic search algorithms are not well understood. In this paper, we introduce a new metric, mobility, that quantifies the dispersion of local o...
Monte Lunacek, L. Darrell Whitley, James N. Knight
GECCO
2005
Springer
141views Optimization» more  GECCO 2005»
15 years 3 months ago
Local and global order 3/2 convergence of a surrogate evolutionary algorithm
A Quasi-Monte-Carlo method based on the computation of a surrogate model of the fitness function is proposed, and its convergence at super-linear rate 3/2 is proved under rather ...
Anne Auger, Marc Schoenauer, Olivier Teytaud
DCOSS
2006
Springer
15 years 1 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
FOCS
2008
IEEE
15 years 4 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak