Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012
A class of dynamic resource allocation problems with infinite planning horizon are studied. We observe special structures in the dynamic programming formulation of the problem, which enable us to convert it to continuous optimization problems that can be more easily solved. Structural properties of the problems are discussed, and explicit solutions are given for some special cases. © 2005 IEEE.
Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012
Elliot Linzer, M. Vetterli
Computing
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
Preeti Malakar, Thomas George, et al.
SC 2012