952 search results - page 12 / 191 » Computational complexity of stochastic programming problems |
AI
2000
Springer
15 years 9 days ago
2000
Springer
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
114
click to vote
CSFW
2011
IEEE
14 years 8 days ago
2011
IEEE
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
117
click to vote
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
110
Voted
ICALP
2009
Springer
16 years 22 days ago
2009
Springer
A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We s...
MP
2006
15 years 12 days ago
2006
Monte Carlo methods have been used extensively in the area of stochastic programming. As with other methods that involve a level of uncertainty, theoretical properties are required...