4544 search results - page 389 / 909 » Reinforcement Learning with Time |
126
Voted
CSR
2007
Springer
15 years 10 months ago
2007
Springer
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
123
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The focus of this paper is on how to design evolutionary algorithms (EAs) for solving stochastic dynamic optimization problems online, i.e. as time goes by. For a proper design, t...
127
Voted
SIGCSE
1997
ACM
15 years 8 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.; ...
155
Voted
BCSHCI
2008
15 years 6 months ago
2008
The comparative study described in this paper has been conducted to investigate the effect of including multimodal metaphors on the usability of e-learning interfaces. Two indepen...
164
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. In this problem, at each time, a player chooses K out of N (N > K) arms to play. The state of ...