Sciweavers

1099 search results - page 37 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 3 months ago
CGP visits the Santa Fe trail: effects of heuristics on GP
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
Cezary Z. Janikow, Christopher J. Mann
GECCO
2009
Springer
132views Optimization» more  GECCO 2009»
14 years 7 months ago
Cooperative micro-particle swarm optimization
Cooperative approaches have proved to be very useful in evolutionary computation due to their ability to solve efficiently high-dimensional complex problems through the cooperatio...
Konstantinos E. Parsopoulos
GECCO
2004
Springer
139views Optimization» more  GECCO 2004»
15 years 3 months ago
Chemical Genetic Programming - Coevolution Between Genotypic Strings and Phenotypic Trees
Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings ...
Wojciech Piaseczny, Hideaki Suzuki, Hidefumi Sawai
ISNN
2005
Springer
15 years 3 months ago
Feature Selection and Intrusion Detection Using Hybrid Flexible Neural Tree
Current Intrusion Detection Systems (IDS) examine all data features to detect intrusion or misuse patterns. Some of the features may be redundant or contribute little (if anything)...
Yuehui Chen, Ajith Abraham, Ju Yang
PATAT
1995
Springer
122views Education» more  PATAT 1995»
15 years 1 months ago
A Memetic Algorithm for University Exam Timetabling
The scheduling of exams in institutions of higher education is known to be a highly constrained problem. The advent of modularity in many institutions in the UK has resulted in a s...
Edmund K. Burke, James P. Newall, Rupert F. Weare