Sciweavers

14548 search results - page 2685 / 2910
» The Optimal Path-Matching Problem
Sort
View
GECCO
2003
Springer
15 years 11 months ago
Generative Representations for Evolving Families of Designs
Abstract. Since typical evolutionary design systems encode only a single artifact with each individual, each time the objective changes a new set of individuals must be evolved. Wh...
Gregory Hornby
GECCO
2003
Springer
182views Optimization» more  GECCO 2003»
15 years 11 months ago
Modeling the Search Landscape of Metaheuristic Software Clustering Algorithms
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
Brian S. Mitchell, Spiros Mancoridis
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
15 years 11 months ago
Dispersion-Based Population Initialization
Reliable execution and analysis of an evolutionary algorithm (EA) normally requires many runs to provide reasonable assurance that stochastic effects have been properly considered...
Ronald W. Morrison
GECCO
2003
Springer
128views Optimization» more  GECCO 2003»
15 years 11 months ago
Cellular Programming and Symmetric Key Cryptography Systems
Abstract. The problem of designing symmetric key cryptography algorithms based upon cellular automata (CAs) is considered. The reliability of the Vernam cipher used in the process ...
Franciszek Seredynski, Pascal Bouvry, Albert Y. Zo...
ICCS
2003
Springer
15 years 11 months ago
Self-Adapting Numerical Software and Automatic Tuning of Heuristics
Self-Adapting Numerical Software (SANS) systems aim to bridge the knowledge gap that exists between the expertise of domain scientists, and the know-how that is needed to fulfill...
Jack Dongarra, Victor Eijkhout
« Prev « First page 2685 / 2910 Last » Next »