Sciweavers

5183 search results - page 370 / 1037
» The Complexity of Distributions
Sort
View
SAC
2008
ACM
15 years 6 months ago
Adaptive methods for sequential importance sampling with application to state space models
Abstract. In this paper we discuss new adaptive proposal strategies for sequential Monte Carlo algorithms--also known as particle filters--relying on new criteria evaluating the qu...
Julien Cornebise, Eric Moulines, Jimmy Olsson
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
16 years 8 days ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
SRDS
2000
IEEE
15 years 11 months ago
Dynamic Node Management and Measure Estimation in a State-Driven Fault Injector
Validation of distributed systems using fault injection is difficult because of their inherent complexity, lack of a global clock, and lack of an easily accessible notion of a gl...
Ramesh Chandra, Michel Cukier, Ryan M. Lefever, Wi...
UAI
2003
15 years 8 months ago
On Information Regularization
We formulate a principle for classification with the knowledge of the marginal distribution over the data points (unlabeled data). The principle is cast in terms of Tikhonov styl...
Adrian Corduneanu, Tommi Jaakkola
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 5 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...