Sciweavers

281 search results - page 34 / 57
» Code Compaction Using Genetic Algorithms
Sort
View
VTS
1998
IEEE
97views Hardware» more  VTS 1998»
13 years 11 months ago
On the Identification of Optimal Cellular Automata for Built-In Self-Test of Sequential Circuits
This paper presents a BIST architecture for Finite State Machines that exploits Cellular Automata (CA) as pattern generators and signature analyzers. The main advantage of the pro...
Fulvio Corno, Nicola Gaudenzi, Paolo Prinetto, Mat...
GECCO
2005
Springer
159views Optimization» more  GECCO 2005»
14 years 9 days ago
Using evolutionary algorithms for the unit testing of object-oriented software
As the paradigm of object orientation becomes more and more important for modern IT development projects, the demand for an automated test case generation to dynamically test obje...
Stefan Wappler, Frank Lammermann
GECCO
2004
Springer
14 years 4 days ago
Three Evolutionary Codings of Rectilinear Steiner Arborescences
A rectilinear Steiner arborescence connects points in the Euclidean plane’s first quadrant and the origin with directed rectilinear edges from the origin up and to the right. Th...
Bryant A. Julstrom, Athos Antoniades
JMLR
2010
110views more  JMLR 2010»
13 years 1 months ago
Attribute Selection Based on FRiS-Compactness
Commonly to classify new object in Data Mining one should estimate its similarity with given classes. Function of Rival Similarity (FRiS) is assigned to calculate quantitative mea...
Nikolay G. Zagoruiko, Irina V. Borisova, Vladimir ...
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 7 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