9325 search results - page 231 / 1865 » The decentralized implementability problem |
128
click to vote
TJS
2002
15 years 3 months ago
2002
Abstract. This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time soluti...
126
click to vote
EVOW
2007
Springer
15 years 10 months ago
2007
Springer
Memetic algorithms usually employ long running times, since local search is performed every time a new solution is generated. Acceleration of a memetic algorithm requires focusing ...
115
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
155
click to vote
BERTINORO
2005
Springer
15 years 9 months ago
2005
Springer
We consider the problem of assigning transmission powers to the nodes of a wireless network in such a way that all the nodes are connected by bidirectional links and the total powe...
143
click to vote
PATAT
2004
Springer
15 years 9 months ago
2004
Springer
A hybrid Multi-Objective Evolutionary Algorithm is used to tackle the uncapacitated exam proximity problem. In this hybridization, local search operators are used instead of the tr...