Sciweavers

118 search results - page 9 / 24
» Randomized Local Search, Evolutionary Algorithms, and the Mi...
Sort
View
JDA
2007
97views more  JDA 2007»
13 years 7 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia
WINET
2010
128views more  WINET 2010»
13 years 6 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
14 years 27 days ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
14 years 1 months ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel
COR
2007
143views more  COR 2007»
13 years 7 months ago
A memetic algorithm for channel assignment in wireless FDMA systems
A new problem encoding is devised for the minimum span frequency assignment problem in wireless communications networks which is compact and general. Using the new encoding, which...
Sung-Soo Kim, Alice E. Smith, Jong-Hyun Lee