Sciweavers

5608 search results - page 695 / 1122
» On the Theory of Matchgate Computations
Sort
View
CCCG
2009
15 years 8 months ago
Bold Graph Drawings
When a graph is drawn in a classical manner, its vertices are shown as small disks and its edges with a positive width; zero-width edges exist only in theory. Let r denote the rad...
Marc J. van Kreveld
CORR
2008
Springer
115views Education» more  CORR 2008»
15 years 8 months ago
Playing With Population Protocols
Population protocols have been introduced as a model of sensor networks consisting of very limited mobile agents with no control over their own movement: A collection of anonymous ...
Olivier Bournez, Jérémie Chalopin, J...
GECCO
2008
Springer
157views Optimization» more  GECCO 2008»
15 years 8 months ago
Self-adaptive mutation rates in genetic algorithm for inverse design of cellular automata
Self-adaptation is used a lot in Evolutionary Strategies and with great success, yet for some reason it is not the mutation adaptation of choice for Genetic Algorithms. This poste...
Ron Breukelaar, Thomas Bäck
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
15 years 8 months ago
Designing EDAs by using the elitist convergent EDA concept and the boltzmann distribution
This paper presents a theoretical definition for designing EDAs called Elitist Convergent Estimation of Distribution Algorithm (ECEDA), and a practical implementation: the Boltzm...
Sergio Ivvan Valdez Peña, Arturo Hern&aacut...
GECCO
2008
Springer
109views Optimization» more  GECCO 2008»
15 years 8 months ago
Focused no free lunch theorems
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
Darrell Whitley, Jonathan E. Rowe