Sciweavers

1576 search results - page 232 / 316
» Properties of Synthetic Optimization Problems
Sort
View
163
Voted
ISORC
2005
IEEE
15 years 10 months ago
On Real-Time Performance of Ahead-of-Time Compiled Java
One of the main challenges in getting acceptance for safe object-oriented languages in hard real-time systems is to combine automatic memory management with hard real-time constra...
Anders Nilsson, Sven Gestegard Robertz
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
15 years 10 months ago
Information landscapes and the analysis of search algorithms
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...
Yossi Borenstein, Riccardo Poli
GECCO
2005
Springer
113views Optimization» more  GECCO 2005»
15 years 10 months ago
A multi-objective algorithm for DS-CDMA code design based on the clonal selection principle
This paper proposes a new algorithm based on the clonal selection principle for the design of spreading codes for DS-CDMA. The algorithm follows a multi-objective approach, genera...
Daniel Stevens, Sanjoy Das, Balasubramaniam Natara...
GECCO
2005
Springer
141views Optimization» more  GECCO 2005»
15 years 10 months ago
Behavior of finite population variable length genetic algorithms under random selection
In this work we provide empirical evidence that shows how a variable-length genetic algorithm (GA) can naturally evolve shorter average size populations. This reduction in chromos...
Hal Stringer, Annie S. Wu
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
15 years 10 months ago
Softening the Structural Difficulty in Genetic Programming with TAG-Based Representation and Insertion/Deletion Operators
In a series of papers [3-8], Daida et. al. highlighted the difficulties posed to Genetic Programming (GP) by the complexity of the structural search space, and attributed the probl...
Nguyen Xuan Hoai, Robert I. McKay