Sciweavers

529 search results - page 38 / 106
» A framework for the description of evolutionary algorithms
Sort
View
144
Voted
SYNASC
2005
IEEE
170views Algorithms» more  SYNASC 2005»
15 years 9 months ago
Density Based Clustering with Crowding Differential Evolution
The aim of this work is to analyze the applicability of crowding differential evolution to unsupervised clustering. The basic idea of this approach, interpreting the clustering pr...
Daniela Zaharie
131
Voted
CEC
2009
IEEE
15 years 10 months ago
Towards creative design using collaborative interactive genetic algorithms
— We present a computational model of creative design based on collaborative interactive genetic algorithms. We test our model on floorplanning. We guide the evolution of floor...
Juan C. Quiroz, Sushil J. Louis, Amit Banerjee, Se...
146
Voted
MKWI
2008
190views Business» more  MKWI 2008»
15 years 5 months ago
Partial Matchmaking for complex Product and Service Descriptions
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
Heiner Stuckenschmidt, Martin Kolb
141
Voted
EVOW
2011
Springer
14 years 7 months ago
Towards Procedural Strategy Game Generation: Evolving Complementary Unit Types
The Strategy Game Description Game Language (SGDL) is intended to become a complete description of all aspects of strategy games, including rules, parameters, scenarios, maps, and ...
Tobias Mahlmann, Julian Togelius, Georgios N. Yann...
126
Voted
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
15 years 5 months ago
Stochastic local search in continuous domains: questions to be answered when designing a novel algorithm
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...
Petr Posik