Sciweavers

270 search results - page 34 / 54
» A robust model for finding optimal evolutionary trees
Sort
View
CEC
2011
IEEE
13 years 9 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
IJAIT
2008
99views more  IJAIT 2008»
14 years 9 months ago
Optimal Basic Block Instruction Scheduling for Multiple-Issue Processors Using Constraint Programming
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction sch...
Abid M. Malik, Jim McInnes, Peter van Beek
GECCO
2009
Springer
162views Optimization» more  GECCO 2009»
14 years 7 months ago
Uncertainty handling CMA-ES for reinforcement learning
The covariance matrix adaptation evolution strategy (CMAES) has proven to be a powerful method for reinforcement learning (RL). Recently, the CMA-ES has been augmented with an ada...
Verena Heidrich-Meisner, Christian Igel
WSTST
2005
Springer
15 years 3 months ago
Hybrid Neurocomputing for Breast Cancer Detection
Breast cancer is one of the major tumor related cause of death in women. Various artificial intelligence techniques have been used to improve the diagnoses procedures and to aid t...
Yuehui Chen, Ajith Abraham, Bo Yang
AAAI
2006
14 years 11 months ago
Prob-Maxn: Playing N-Player Games with Opponent Models
Much of the work on opponent modeling for game tree search has been unsuccessful. In two-player, zero-sum games, the gains from opponent modeling are often outweighed by the cost ...
Nathan R. Sturtevant, Martin Zinkevich, Michael H....