952 search results - page 111 / 191 » Computational complexity of stochastic programming problems |
111
click to vote
SIAMJO
2010
14 years 9 months ago
2010
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
136
click to vote
ESA
1998
Springer
15 years 7 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
151
click to vote
ALDT
2009
Springer
15 years 9 months ago
2009
Springer
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
218
click to vote
TOPLAS
2008
15 years 2 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
124
click to vote
ATAL
2009
Springer
15 years 9 months ago
2009
Springer
Poker games provide a useful testbed for modern Artificial Intelligence techniques. Unlike many classical game domains such as chess and checkers, poker includes elements of impe...