Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
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.
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007