672 search results - page 17 / 135 » Policy Search by Dynamic Programming |
114
click to vote
HIPC
2007
Springer
15 years 3 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
ATAL
2010
Springer
15 years 23 days ago
2010
Springer
In this paper we study, for the first time explicitly, the implications of endowing an interested party (i.e. a teacher) with the ability to modify the underlying dynamics of the ...
FLAIRS
2009
14 years 9 months ago
2009
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
80
Voted
IWMM
1998
Springer
15 years 3 months ago
1998
Springer
We show that for 8 real and varied C and C++ programs, several conventional dynamic storage allocators provide nearzero fragmentation, once we account for overheads due to impleme...
119
click to vote
CPAIOR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...