Sciweavers

2354 search results - page 87 / 471
» Randomness, Stochasticity and Approximations
Sort
View
SIGPRO
2010
73views more  SIGPRO 2010»
13 years 7 months ago
Continuous-time and continuous-discrete-time unscented Rauch-Tung-Striebel smoothers
This article considers the application of the unscented transformation to approximate fixed-interval optimal smoothing of continuous-time non-linear stochastic systems. The propo...
Simo Särkkä
IPL
2000
146views more  IPL 2000»
13 years 9 months ago
Better approximations for max TSP
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
Refael Hassin, Shlomi Rubinstein
FSTTCS
1999
Springer
14 years 1 months ago
A Randomized Algorithm for Flow Shop Scheduling
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...
Naveen Garg, Sachin Jain, Chaitanya Swamy
JMLR
2010
129views more  JMLR 2010»
13 years 3 months ago
Approximation of hidden Markov models by mixtures of experts with application to particle filtering
Selecting conveniently the proposal kernel and the adjustment multiplier weights of the auxiliary particle filter may increase significantly the accuracy and computational efficie...
Jimmy Olsson, Jonas Ströjby
QEST
2009
IEEE
14 years 3 months ago
Mean-Field Analysis for the Evaluation of Gossip Protocols
—Gossip protocols are designed to operate in very large, decentralised networks. A node in such a network bases its decision to interact (gossip) with another node on its partial...
Rena Bakhshi, Lucia Cloth, Wan Fokkink, Boudewijn ...