Sciweavers

715 search results - page 57 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
SAC
2004
ACM
15 years 3 months ago
Solving the error correcting code problem with parallel hybrid heuristics
Some telecommunication systems can not afford the cost of repeating a corrupted message. Instead, the message should be somewhat “corrected” by the receiver. In these cases a...
Enrique Alba, J. Francisco Chicano
GECCO
2004
Springer
155views Optimization» more  GECCO 2004»
15 years 3 months ago
Genetic Network Programming with Reinforcement Learning and Its Performance Evaluation
A new graph-based evolutionary algorithm named “Genetic Network Programming, GNP” has been proposed. GNP represents its solutions as directed graph structures, which can improv...
Shingo Mabu, Kotaro Hirasawa, Jinglu Hu
HM
2010
Springer
161views Optimization» more  HM 2010»
14 years 11 months ago
A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents
The reconstruction of destroyed paper documents became of more interest during the last years. On the one hand it (often) occurs that documents are destroyed by mistake while on th...
Christian Schauer, Matthias Prandtstetter, Gü...
COMSWARE
2008
IEEE
15 years 4 months ago
Community based search on power law networks
—In this paper, we have presented a novel algorithm for searching Peer-to-Peer (P2P) networks which forms power law topology. It is completely decentralized in nature and hence i...
Tathagata Das, Subrata Nandi, Niloy Ganguly
AE
2009
Springer
14 years 11 months ago
Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez