Sciweavers

1830 search results - page 14 / 366
» Optimizing Sorting with Genetic Algorithms
Sort
View
69
Voted
CORR
2004
Springer
81views Education» more  CORR 2004»
14 years 9 months ago
Optimizing genetic algorithm strategies for evolving networks
This paper explores the use of genetic algorithms for the design of networks, where the demands on the network fluctuate in time. For varying network constraints, we find the best...
Matthew J. Berryman, Andrew Allison, Derek Abbott
EC
2002
228views ECommerce» more  EC 2002»
14 years 9 months ago
Improved Sampling of the Pareto-Front in Multiobjective Genetic Optimizations by Steady-State Evolution: A Pareto Converging Gen
Previous work on multiobjective genetic algorithms has been focused on preventing genetic drift and the issue of convergence has been given little attention. In this paper, we pre...
Rajeev Kumar, Peter Rockett
STACS
1995
Springer
15 years 1 months ago
Optimal Average Case Sorting on Arrays
Abstract. We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then...
Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, ...
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
14 years 10 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli