255 search results - page 5 / 51 » Learning parallel portfolios of algorithms |
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
COLT
2006
Springer
13 years 11 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
We present a new mechanism for preserving phenotypic behavioural diversity in a Genetic Programming application for hedge fund portfolio optimization, and provide experimental res...
ECCC
2007
13 years 7 months ago
2007
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
CP
2000
Springer
13 years 11 months ago
2000
Springer
This paper addresses the interaction between randomization, with restart strategies, and learning, an often crucial technique for proving unsatisfiability. We use instances of SAT ...