Sciweavers

3136 search results - page 7 / 628
» Genetic programming theory
Sort
View
MFCS
2004
Springer
15 years 3 months ago
Approximating Boolean Functions by OBDDs
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
Andre Gronemeier
GECCO
2005
Springer
195views Optimization» more  GECCO 2005»
15 years 3 months ago
Evolving fuzzy decision tree structure that adapts in real-time
A fuzzy logic algorithm has been developed that automatically allocates electronic attack (EA) resources distributed over different platforms in real-time. The controller must be ...
James F. Smith III
FOGA
1990
14 years 11 months ago
A Hierarchical Approach to Learning the Boolean Multiplexer Function
This paper describes the recently developed genetic programming paradigm which genetically breeds populations of computer programs to solve problems. In genetic programming, the i...
John R. Koza
GECCO
2005
Springer
15 years 3 months ago
Evaluating GP schema in context
We propose a new methodology to look at the fitness contributions (semantics) of different schemata in Genetic Programming (GP). We hypothesize that the significance of a schem...
Hammad Majeed, Conor Ryan, R. Muhammad Atif Azad
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 3 months ago
Stress testing real-time systems with genetic algorithms
Reactive real-time systems have to react to external events within time constraints: Triggered tasks must execute within deadlines. The goal of this article is to automate, based ...
Lionel C. Briand, Yvan Labiche, Marwa Shousha