952 search results - page 62 / 191 » Computational complexity of stochastic programming problems |
105
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
COR
2008
15 years 19 days ago
2008
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
Object-oriented programming, design patterns, and frameworks are common techniques that have been used to reduce the complexity of sequential programming. We have applied these te...
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...