Searching for authors named "Tobias Blickle" – sorted by Relevance.
-
Evolving Compact Solutions in Genetic Programming: A Case Study
- . Genetic programming (GP) is a variant of genetic algorithms where the data structures handled are trees. This makes GP especially useful for evolving functional relationships or computer programs, as both can be represented as trees. Symbolic regression is the determination of a function dependenc
- Cited by 17 (0 self) – Add To MetaCart
-
A Comparison of Selection Schemes used in Evolutionary Algorithms
- Evolutionary Algorithms are a common probabilistic optimization method based on the model of natural evolution. One important operator in these algorithms is the selection scheme for which in this paper a new description model based on fitness distributions is introduced.
- Cited by 46 (2 self) – Add To MetaCart
-
A Comparison of Selection Schemes used in Genetic Algorithms
- Genetic Algorithms are a common probabilistic optimization method based on the model of natural evolution. One important operator in these algorithms is the selection scheme for which a new description model is introduced in this paper. With this a mathematical analysis of tournament selection, trun
- Cited by 55 (3 self) – Add To MetaCart
-
A Mathematical Analysis of Tournament Selection
- Genetic Algorithms are a common probabilistic optimization method based on the model of natural evolution. One important operator in these algorithms is the selection scheme used to prefer better individuals. In this paper a new description model for selection schemes is introduced that operates on
- Cited by 50 (2 self) – Add To MetaCart
-
System-Level Synthesis Using Evolutionary
- In this paper, we consider system- level synthesis as the problem of optimally mapping an algorithm-level specification onto a heterogeneous hardware/software architecture. This problem requires (1) the selection of the architecture (allocation) including general purpose and dedicated processors, AS
- Cited by 68 (32 self) – Add To MetaCart
-
Stochastic Methods for Transistor Size Optimization of CMOS VLSI Circuits
- . The performance of a CMOS circuit depends heavily on its transistor sizes. We have tested a standard optimizer, a Monte Carlo scheme and a method based on Genetic Algorithms combined with very accurate SPICE simulations to automatically optimize transistor sizes of three different digital CMOS cir
- Cited by 4 (0 self) – Add To MetaCart
-
A Prototyping Array for Parallel Architectures
- This paper describes the concept of a two-dimensional prototyping array of FPGAs (Prototyping Array for Parallel Architectures, PAr 2). It was designed for the verification of circuit designs generated by a computer aided tool for mapping algorithms onto parallel architectures. In this paper the int
- Cited by 1 (0 self) – Add To MetaCart
-
An Evolutionary Approach to System-Level Synthesis
- In this paper, we consider system- level synthesis as the problem of optimally mapping a task-level specification onto a heterogeneous hardware/software architecture. This problem requires (1) the selection of the architecture (allocation) including general purpose and dedicated processors, ASICs,
- Cited by 28 (6 self) – Add To MetaCart
-
Genetic Programming and Redundancy
- The Genetic Programming optimization method (GP) elaborated by John Koza [ Koza, 1992 ] is a variant of Genetic Algorithms. The search space of the problem domain consists of computer programs represented as parse trees, and the crossover operator is realized by an exchange of subtrees. Empirical an
- Cited by 48 (1 self) – Add To MetaCart

