Sciweavers

218 search results - page 35 / 44
» Quantum-inspired evolutionary algorithm for a class of combi...
Sort
View
GECCO
2005
Springer
14 years 2 months ago
Theme preservation and the evolution of representation
The identification of mechanisms by which constraints on phenotypic variability are tuned in nature, and the implementation of these mechanisms in Evolutionary Algorithms (EAs) ca...
Keki M. Burjorjee, Jordan B. Pollack
IEEECIT
2009
IEEE
14 years 3 months ago
Clustering of Software Systems Using New Hybrid Algorithms
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
Ali Safari Mamaghani, Mohammad Reza Meybodi
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 9 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 9 months ago
Threshold selecting: best possible probability distribution for crossover selection in genetic algorithms
The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatoria...
Jörg Lässig, Karl Heinz Hoffmann, Mihael...
MFCS
2004
Springer
14 years 1 months ago
The Bidimensional Theory of Bounded-Genus Graphs
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitr...