Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
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.
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Thomas M. Cheng
IT Professional
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006