410 search results - page 49 / 82 » Analysis of stochastic dual dynamic programming method |
SCP
2010
14 years 10 months ago
2010
One of the most challenging tasks a programmer can face is attempting to analyse and understand a legacy assembler system. Many features of assembler make analysis difficult, and ...
OOPSLA
2004
Springer
15 years 5 months ago
2004
Springer
As improvements in processor speed continue to outpace improvements in cache and memory speed, poor locality increasingly degrades performance. Because copying garbage collectors ...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
119
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
116
click to vote
HYBRID
2009
Springer
15 years 6 months ago
2009
Springer
We investigate a new approach for solving boundary control problems for dynamical systems that are governed by transport equations, when the control function is restricted to binar...