Sciweavers

1578 search results - page 124 / 316
» Algorithmic randomness of continuous functions
Sort
View
WSC
2007
15 years 6 days ago
Optimal scheduling of probabilistic repetitive projects using completed unit and genetic algorithms
In this paper we introduce the completed unit algorithm (CU-AL), a probabilistic scheduling methodology for repetitive projects. The algorithm has two main advantages, simplicity ...
Chachrist Srisuwanrat, Photios G. Ioannou
AE
2005
Springer
15 years 3 months ago
An Immunological Algorithm for Global Numerical Optimization
Abstract. Numerical optimization of given objective functions is a crucial task in many real-life problems. The present article introduces an immunological algorithm for continuous...
Vincenzo Cutello, Giuseppe Narzisi, Giuseppe Nicos...
IPPS
2008
IEEE
15 years 4 months ago
A transparent non-invasive file data model for algorithmic skeletons
A file data model for algorithmic skeletons is proposed, focusing on transparency and efficiency. Algorithmic skeletons correspond to a high-level programming model that takes a...
Denis Caromel, Mario Leyton
GECCO
2007
Springer
200views Optimization» more  GECCO 2007»
15 years 4 months ago
Performance analysis of niching algorithms based on derandomized-ES variants
A survey of niching algorithms, based on 5 variants of derandomized Evolution Strategies (ES), is introduced. This set of niching algorithms, ranging from the very first derandom...
Ofer M. Shir, Thomas Bäck
AE
2003
Springer
15 years 3 months ago
From Royal Road to Epistatic Road for Variable Length Evolution Algorithm
Although there are some real world applications where the use of variable length representation (VLR) in Evolutionary Algorithm is natural and suitable, an academic framework is la...
Michael Defoin-Platel, Sébastien Vér...