Sciweavers

715 search results - page 21 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
APIN
2007
118views more  APIN 2007»
13 years 7 months ago
Using genetic algorithms to reorganize superpeer structure in peer to peer networks
In this thesis, we describe a genetic algorithm for optimizing the superpeer structure of semantic peer to peer networks. Peer to peer, also called P2P, networks enable us to sear...
Jaymin Kessler, Khaled Rasheed, Ismailcem Budak Ar...
VLSID
2000
IEEE
94views VLSI» more  VLSID 2000»
13 years 11 months ago
A Genetic Algorithm for the Synthesis of Structured Data Paths
The technique presented here achieves simultaneous optimization of schedule time and data path component cost within a structured data path architecture, using a genetic algorithm...
Chittaranjan A. Mandal, R. M. Zimmer
ISCC
2006
IEEE
188views Communications» more  ISCC 2006»
14 years 1 months ago
Dejong Function Optimization by Means of a Parallel Approach to Fuzzified Genetic Algorithm
Genetic Algorithms are very powerful search methods that are used in different optimization problems. Parallel versions of genetic algorithms are easily implemented and usually in...
Ebrahim Bagheri, Hossein Deldari
JCO
2007
123views more  JCO 2007»
13 years 7 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
14 years 28 days ago
Combining competent crossover and mutation operators: a probabilistic model building approach
This paper presents an approach to combine competent crossover and mutation operators via probabilistic model building. Both operators are based on the probabilistic model buildin...
Cláudio F. Lima, Kumara Sastry, David E. Go...