Sciweavers

2354 search results - page 86 / 471
» Randomness, Stochasticity and Approximations
Sort
View
ANOR
2010
112views more  ANOR 2010»
15 years 2 months ago
Online stochastic optimization under time constraints
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Pascal Van Hentenryck, Russell Bent, Eli Upfal
JMLR
2010
140views more  JMLR 2010»
14 years 11 months ago
Mean Field Variational Approximation for Continuous-Time Bayesian Networks
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact r...
Ido Cohn, Tal El-Hay, Nir Friedman, Raz Kupferman
ANTSW
2004
Springer
15 years 9 months ago
S-ACO: An Ant-Based Approach to Combinatorial Optimization Under Uncertainty
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...
Walter J. Gutjahr
SIAMCOMP
1998
137views more  SIAMCOMP 1998»
15 years 4 months ago
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
Sridhar Rajagopalan, Vijay V. Vazirani
HYBRID
2005
Springer
15 years 10 months ago
A Toolbox of Hamilton-Jacobi Solvers for Analysis of Nondeterministic Continuous and Hybrid Systems
Abstract. Hamilton-Jacobi partial differential equations have many applications in the analysis of nondeterministic continuous and hybrid systems. Unfortunately, analytic solution...
Ian M. Mitchell, Jeremy A. Templeton