Sciweavers

1434 search results - page 16 / 287
» Stochastic computation
Sort
View
88
Voted
ICALP
2007
Springer
15 years 3 months ago
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...
Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
70
Voted
EOR
2006
104views more  EOR 2006»
14 years 9 months ago
A factor 1/2 approximation algorithm for two-stage stochastic matching problems
We introduce the two-stage stochastic maximum-weight matching problem and demonstrate that this problem is NP-complete. We give a factor 1 2 approximation algorithm and prove its ...
Nan Kong, Andrew J. Schaefer
84
Voted
ARTS
1999
Springer
15 years 1 months ago
Specifying Performance Measures for PEPA
Stochastic process algebras such as PEPA provide ample support for the component-based construction of models. Tools compute the numerical solution of these models; however, the st...
Graham Clark, Stephen Gilmore, Jane Hillston
QEST
2010
IEEE
14 years 7 months ago
On the Theory of Stochastic Processors
Traditional architecture design approaches hide hardware uncertainties from the software stack through overdesign, which is often expensive in terms of power consumption. The recen...
Parasara Sridhar Duggirala, Sayan Mitra, Rakesh Ku...
SAINT
2005
IEEE
15 years 3 months ago
A Matrix Pattern Compliant Strong Stochastic Bound
Stochastic bounds are a promising method to analyze QoS requirements. Indeed it is sufficient to prove that a bound of the real performance satisfies the guarantee. However, the...
Ana Busic, Jean-Michel Fourneau