Sciweavers

148 search results - page 26 / 30
» Optimizing random walk search algorithms in P2P networks
Sort
View
GECCO
2007
Springer
256views Optimization» more  GECCO 2007»
14 years 5 months ago
A particle swarm optimization approach for estimating parameter confidence regions
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
Praveen Koduru, Stephen Welch, Sanjoy Das
SPAA
2004
ACM
14 years 4 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
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
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 5 months ago
Evolving virtual creatures revisited
Thirteen years have passed since Karl Sims published his work on evolving virtual creatures. Since then, several novel approaches to neural network evolution and genetic algorithm...
Peter Krcah
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
14 years 2 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley