952 search results - page 28 / 191 » Computational complexity of stochastic programming problems |
LPNMR
2007
Springer
14 years 5 months ago
2007
Springer
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
STOC
2004
ACM
14 years 11 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
GRID
2004
Springer
14 years 4 months ago
2004
Springer
We introduce a formal model for deployment and hosting of a dynamic grid service wherein the service provider must pay a resource provider for the use of computational resources. ...
CSL
2007
Springer
14 years 5 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
APN
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. In this work, we address the problem of transient and steadystate analysis of a stochastic Petri net which includes non Markovian distributions with a finite support but ...