Sciweavers

1253 search results - page 145 / 251
» Convergence of Evolutionary Algorithms in General Search Spa...
Sort
View
CORR
2008
Springer
95views Education» more  CORR 2008»
15 years 6 months ago
Explicit Learning: an Effort towards Human Scheduling Algorithms
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
Jingpeng Li, Uwe Aickelin
MM
2005
ACM
164views Multimedia» more  MM 2005»
15 years 12 months ago
Automatic discovery of query-class-dependent models for multimodal search
We develop a framework for the automatic discovery of query classes for query-class-dependent search models in multimodal retrieval. The framework automatically discovers useful q...
Lyndon S. Kennedy, Apostol Natsev, Shih-Fu Chang
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
15 years 10 months ago
The role of diverse populations in phylogenetic analysis
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
Tiffani L. Williams, Marc L. Smith
GECCO
2009
Springer
128views Optimization» more  GECCO 2009»
16 years 1 months ago
Neural network ensembles for time series forecasting
This work provides an analysis of using the evolutionary algorithm EPNet to create ensembles of artificial neural networks to solve a range of forecasting tasks. Several previous...
Victor M. Landassuri-Moreno, John A. Bullinaria
IWCLS
2007
Springer
16 years 17 days ago
On Lookahead and Latent Learning in Simple LCS
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
Larry Bull