Sciweavers

908 search results - page 167 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
14 years 3 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel
ICCAD
2002
IEEE
161views Hardware» more  ICCAD 2002»
14 years 7 months ago
Non-tree routing for reliability and yield improvement
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
Andrew B. Kahng, Bao Liu, Ion I. Mandoiu
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
14 years 5 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
EMSOFT
2007
Springer
14 years 5 months ago
Optimal task placement to improve cache performance
Most recent embedded systems use caches to improve their average performance. Current timing analyses are able to compute safe timing guarantees for these systems, if tasks are ru...
Gernot Gebhard, Sebastian Altmeyer
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
14 years 4 months ago
Intransitivity revisited coevolutionary dynamics of numbers games
Relative fitness, or “evaluation by tests” is one of the building blocks of coevolution: the only fitness information available is a comparison with other individuals in a p...
Pablo Funes, Enrique Pujals