Sciweavers

5082 search results - page 649 / 1017
» Hierarchical Genetic Algorithms
Sort
View
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
15 years 8 months ago
Optimal Random Matchings on Trees and Applications
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
Jeff Abrahamson, Béla Csaba, Ali Shokoufand...
UAI
2003
15 years 8 months ago
Policy-contingent abstraction for robust robot control
ontingent abstraction for robust robot control Joelle Pineau, Geoff Gordon and Sebastian Thrun School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 This pape...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
SCAM
2008
IEEE
16 years 1 months ago
Constructing Subtle Faults Using Higher Order Mutation Testing
Traditional mutation testing considers only first order mutants, created by the injection of a single fault. Often these first order mutants denote trivial faults that are easil...
Yue Jia, Mark Harman
GECCO
2007
Springer
186views Optimization» more  GECCO 2007»
16 years 28 days ago
A multi-objective approach for the prediction of loan defaults
Credit institutions are seldom faced with problems dealing with single objectives. Often, decisions involving optimizing two or more competing goals simultaneously need to be made...
Oluwarotimi Odeh, Praveen Koduru, Sanjoy Das, Alle...
ITCC
2005
IEEE
16 years 10 days ago
Real Stock Trading Using Soft Computing Models
The main focus of this study is to compare different performances of soft computing paradigms for predicting the direction of individuals stocks. Three different artificial intell...
Brent Doeksen, Ajith Abraham, Johnson P. Thomas, M...