154 search results - page 7 / 31 » Linear Dynamic Programs for Resource Management |
167
click to vote
ASPLOS
2009
ACM
15 years 10 months ago
2009
ACM
The growth in complexity of modern systems makes it increasingly difficult to extract high-performance. The software stacks for such systems typically consist of multiple layers a...
AGENTS
1998
Springer
15 years 1 months ago
1998
Springer
Mobile agents are programs that can migrate from machine to machine in a heterogeneous, partially disconnected network. As mobile agents move across a network, they consume resour...
IAT
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, the merging of tw...
139
click to vote
POPL
2003
ACM
15 years 9 months ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
IOR
2008
14 years 9 months ago
2008
The stochastic knapsack has been used as a model in wide ranging applications from dynamic resource allocation to admission control in telecommunication. In recent years, a variat...