Sciweavers

1380 search results - page 201 / 276
» Computing the optimal strategy to commit to
Sort
View
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
13 years 11 months ago
Estimating the destructiveness of crossover on binary tree representations
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
Luke Sheneman, James A. Foster
GECCO
2010
Springer
220views Optimization» more  GECCO 2010»
13 years 11 months ago
Interday foreign exchange trading using linear genetic programming
Foreign exchange (forex) market trading using evolutionary algorithms is an active and controversial area of research. We investigate the use of a linear genetic programming (LGP)...
Garnett Carl Wilson, Wolfgang Banzhaf
AAAI
2007
13 years 10 months ago
Acquiring Visibly Intelligent Behavior with Example-Guided Neuroevolution
Much of artificial intelligence research is focused on devising optimal solutions for challenging and well-defined but highly constrained problems. However, as we begin creating...
Bobby D. Bryant, Risto Miikkulainen
AAAI
2006
13 years 9 months ago
When a Decision Tree Learner Has Plenty of Time
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
MONET
2006
107views more  MONET 2006»
13 years 8 months ago
Utilization and fairness in spectrum assignment for opportunistic spectrum access
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive d...
Chunyi Peng, Haitao Zheng, Ben Y. Zhao