952 search results - page 108 / 191 » Computational complexity of stochastic programming problems |
154
Voted
BMCBI
2006
15 years 3 months ago
2006
Background: We consider the problem of parameter estimation (model calibration) in nonlinear dynamic models of biological systems. Due to the frequent ill-conditioning and multi-m...
124
click to vote
MOBIHOC
2006
ACM
16 years 2 months ago
2006
ACM
Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. This paper introduces stora...
119
click to vote
AIED
2009
Springer
15 years 9 months ago
2009
Springer
The core problem we address in this paper is how to take a declarative conceptual representation of a complex system and produce an agent-based simulation of that model. In particu...
106
click to vote
STOC
2010
ACM
16 years 10 days ago
2010
ACM
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
125
click to vote
TCS
2008
15 years 2 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...