Sciweavers

15375 search results - page 3048 / 3075
» cans 2008
Sort
View
FSTTCS
2008
Springer
13 years 8 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 8 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
GECCO
2008
Springer
117views Optimization» more  GECCO 2008»
13 years 8 months ago
CrossNet: a framework for crossover with network-based chromosomal representations
We propose a new class of crossover operators for genetic algorithms (CrossNet) which use a network-based (or graphbased) chromosomal representation. We designed CrossNet with the...
Forrest Stonedahl, William Rand, Uri Wilensky
GECCO
2008
Springer
186views Optimization» more  GECCO 2008»
13 years 8 months ago
A pareto following variation operator for fast-converging multiobjective evolutionary algorithms
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder, Michael Kirley, Ra...
GECCO
2008
Springer
127views Optimization» more  GECCO 2008»
13 years 8 months ago
Adaptive discretization on multidimensional continuous search spaces
This paper extends an adaptive discretization method, Spliton-Demand (SoD), to be capable of handling multidimensional continuous search spaces. The proposed extension is called m...
Jiun-Jiue Liou, Ying-Ping Chen
« Prev « First page 3048 / 3075 Last » Next »