Sciweavers

840 search results - page 119 / 168
» Inapproximability of Combinatorial Optimization Problems
Sort
View
GECCO
2003
Springer
14 years 4 months ago
Chromosome Reuse in Genetic Algorithms
This paper introduces a novel genetic algorithm strategy based on the reuse of chromosomes from previous generations in the creation of offspring individuals. A number of chromoso...
Adnan Acan, Yüce Tekol
GECCO
2003
Springer
120views Optimization» more  GECCO 2003»
14 years 4 months ago
New Usage of SOM for Genetic Algorithms
Abstract. Self-Organizing Map (SOM) is an unsupervised learning neural network and it is used for preserving the structural relationships in the data without prior knowledge. SOM h...
Jung Hwan Kim, Byung Ro Moon
JUCS
2008
139views more  JUCS 2008»
13 years 11 months ago
Parallel Strategies for Stochastic Evolution
: This paper discusses the parallelization of Stochastic Evolution (StocE) metaheuristic, for a distributed parallel environment. VLSI cell placement is used as an optimization pro...
Sadiq M. Sait, Khawar S. Khan, Mustafa Imran Ali
PE
2011
Springer
266views Optimization» more  PE 2011»
13 years 6 months ago
Lumping partially symmetrical stochastic models
Performance and dependability evaluation of complex systems by means of dynamic stochastic models (e.g. Markov chains) may be impaired by the combinatorial explosion of their stat...
Souheib Baarir, Marco Beccuti, Claude Dutheillet, ...
TELSYS
2011
207views Education» more  TELSYS 2011»
13 years 6 months ago
GRASP: basic components and enhancements
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
Paola Festa, Mauricio G. C. Resende