Sciweavers

4007 search results - page 197 / 802
» Computation with imprecise probabilities
Sort
View
EUROPAR
2008
Springer
15 years 5 months ago
Bi-objective Approximation Scheme for Makespan and Reliability Optimization on Uniform Parallel Machines
We study the problem of scheduling independent tasks on a set of related processors which have a probability of failure governed by an exponential law. We are interested in the bi-...
Emmanuel Jeannot, Erik Saule, Denis Trystram
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 4 months ago
Efficient Matrix Completion with Gaussian Models
A general framework based on Gaussian models and a MAPEM algorithm is introduced in this paper for solving matrix/table completion problems. The numerical experiments with the sta...
Flavien Léger, Guoshen Yu, Guillermo Sapiro
ACL
2012
13 years 6 months ago
Using Rejuvenation to Improve Particle Filtering for Bayesian Word Segmentation
We present a novel extension to a recently proposed incremental learning algorithm for the word segmentation problem originally introduced in Goldwater (2006). By adding rejuvenat...
Benjamin Börschinger, Mark Johnson
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
15 years 10 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
GI
2004
Springer
15 years 9 months ago
Crash Management for Distributed Parallel Systems
: With the growing complexity of parallel architectures, the probability of system failures grows, too. One approach to cope with this problem is the self-healing, one of the organ...
Jan Haase, Frank Eschmann