508 search results - page 64 / 102 » Learning for stochastic dynamic programming |
134
click to vote
JMLR
2006
15 years 1 months ago
2006
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
100
click to vote
SIGCSE
1997
ACM
15 years 6 months ago
1997
ACM
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; ...
144
click to vote
JMLR
2012
13 years 4 months ago
2012
To relax the homogeneity assumption of classical dynamic Bayesian networks (DBNs), various recent studies have combined DBNs with multiple changepoint processes. The underlying as...
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
This paper presents a novel approach to clustering using an accuracy-based Learning Classifier System. Our approach achieves this by exploiting the generalization mechanisms inher...
125
click to vote
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
To complement standard fitness functions, we propose "Fitness Importance" (FI) as a novel meta-heuristic for online learning systems. We define FI and show how it can be...