David S. Kung
DAC 1998
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.
David S. Kung
DAC 1998
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009