Sciweavers

6897 search results - page 568 / 1380
» Parallelization of Modular Algorithms
Sort
View
ACSD
2005
IEEE
90views Hardware» more  ACSD 2005»
15 years 12 months ago
Improved Decomposition of STGs
Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a...
Walter Vogler, Ben Kangsah
CEC
2005
IEEE
15 years 12 months ago
Linear genetic programming using a compressed genotype representation
This paper presents a modularization strategy for linear genetic programming (GP) based on a substring compression/substitution scheme. The purpose of this substitution scheme is t...
Johan Parent, Ann Nowé, Kris Steenhaut, Ann...
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
15 years 12 months ago
Investigating the performance of module acquisition in cartesian genetic programming
Embedded Cartesian Genetic Programming (ECGP) is a form of the graph based Cartesian Genetic Programming (CGP) in which modules are automatically acquired and evolved. In this pap...
James Alfred Walker, Julian Francis Miller
113
Voted
ICCS
2005
Springer
15 years 12 months ago
A Logarithmic Time Method for Two's Complementation
This paper proposes an innovative algorithm to find the two’s complement of a binary number. The proposed method works in logarithmic time (O(logN)) instead of the worst case li...
Jung-Yup Kang, Jean-Luc Gaudiot
VISUAL
2005
Springer
15 years 11 months ago
Automatic Redeye Removal for Smart Enhancement of Photos of Unknown Origin
The paper describes a modular procedure for automatic correction of redeye artifact in images of unknown origin, maintaining the natural appearance of the eye. First, a smart color...
Francesca Gasparini, Raimondo Schettini