Sciweavers

798 search results - page 12 / 160
» Using Genetic Algorithms for Solving Hard Problems in GIS
Sort
View
GECCO
2007
Springer
437views Optimization» more  GECCO 2007»
14 years 2 months ago
A gestalt genetic algorithm: less details for better search
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
Christophe Philemotte, Hugues Bersini
EVOW
2004
Springer
14 years 5 days ago
Hardness Prediction for the University Course Timetabling Problem
This paper presents an attempt to find a statistical model that predicts the hardness of the University Course Timetabling Problem by analyzing instance properties. The model may l...
Philipp Kostuch, Krzysztof Socha
IPPS
1998
IEEE
14 years 21 days ago
A Comparative Study of Five Parallel Genetic Algorithms Using the Traveling Salesman Problem
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
Lee Wang, Anthony A. Maciejewski, Howard Jay Siege...
GECCO
2006
Springer
143views Optimization» more  GECCO 2006»
14 years 3 days ago
Heterogeneous cooperative coevolution: strategies of integration between GP and GA
Cooperative coevolution has proven to be a promising technique for solving complex combinatorial optimization problems. In this paper, we present four different strategies which i...
Leonardo Vanneschi, Giancarlo Mauri, Andrea Valsec...
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
14 years 1 days ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
Vitorino Ramos, Fernando Muge