Sciweavers

895 search results - page 128 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
ICCBR
2005
Springer
15 years 4 months ago
Learning to Win: Case-Based Plan Selection in a Real-Time Strategy Game
While several researchers have applied case-based reasoning techniques to games, only Ponsen and Spronck (2004) have addressed the challenging problem of learning to win real-time ...
David W. Aha, Matthew Molineaux, Marc J. V. Ponsen
EUROGP
2007
Springer
126views Optimization» more  EUROGP 2007»
15 years 2 months ago
Training Binary GP Classifiers Efficiently: A Pareto-coevolutionary Approach
The conversion and extension of the Incremental Pareto-Coevolution Archive algorithm (IPCA) into the domain of Genetic Programming classification is presented. In particular, the ...
Michal Lemczyk, Malcolm I. Heywood
KES
2006
Springer
14 years 10 months ago
The Repository Method for Chance Discovery in Financial Forecasting
Abstract. The aim of this work is to forecast future events in financial data sets, in particular, we focus our attention on situations where positive instances are rare, which fal...
Alma Lilia Garcia-Almanza, Edward P. K. Tsang
DMIN
2006
144views Data Mining» more  DMIN 2006»
15 years 6 days ago
Discovering Assignment Rules in Workforce Schedules Using Data Mining
Discovering hidden patterns in large sets of workforce schedules to gain insight into the potential knowledge in workforce schedules are crucial to better understanding the workfor...
Jihong Yan
AIRS
2004
Springer
15 years 4 months ago
Document Clustering Using Linear Partitioning Hyperplanes and Reallocation
This paper presents a novel algorithm for document clustering based on a combinatorial framework of the Principal Direction Divisive Partitioning (PDDP) algorithm [1] and a simpli...
Canasai Kruengkrai, Virach Sornlertlamvanich, Hito...