Sciweavers

3117 search results - page 422 / 624
» The Spatially-Dispersed Genetic Algorithm
Sort
View
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 10 months ago
Algebraic simplification of GP programs during evolution
Program bloat is a fundamental problem in the field of Genetic Programming (GP). Exponential growth of redundant and functionally useless sections of programs can quickly overcome...
Phillip Wong, Mengjie Zhang
AAAI
2004
15 years 8 months ago
Leap Before You Look: An Effective Strategy in an Oversubscribed Scheduling Problem
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
Laura Barbulescu, L. Darrell Whitley, Adele E. How...
EC
2008
146views ECommerce» more  EC 2008»
15 years 6 months ago
Automated Discovery of Local Search Heuristics for Satisfiability Testing
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
Alex S. Fukunaga
ESWA
2006
154views more  ESWA 2006»
15 years 6 months ago
Artificial neural networks with evolutionary instance selection for financial forecasting
In this paper, I propose a genetic algorithm (GA) approach to instance selection in artificial neural networks (ANNs) for financial data mining. ANN has preeminent learning abilit...
Kyoung-jae Kim
ML
2008
ACM
128views Machine Learning» more  ML 2008»
15 years 6 months ago
QG/GA: a stochastic search for Progol
Most search techniques within ILP require the evaluation of a large number of inconsistent clauses. However, acceptable clauses typically need to be consistent, and are only found ...
Stephen Muggleton, Alireza Tamaddoni-Nezhad