Sciweavers

373 search results - page 33 / 75
» On Markov Chains for Independent Sets
Sort
View
CORR
2010
Springer
79views Education» more  CORR 2010»
13 years 4 months ago
Probabilistic cellular automata, invariant measures, and perfect sampling
In a probabilistic cellular automaton (PCA), the cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. A PCA can be vi...
Ana Busic, Jean Mairesse, Irene Marcovici
QEST
2005
IEEE
14 years 1 months ago
Fluid Flow Approximation of PEPA models
In this paper we present a novel performance analysis technique for large-scale systems modelled in the stochastic process algebra PEPA. In contrast to the well-known approach of ...
Jane Hillston
IDA
1999
Springer
13 years 12 months ago
Discovering Dynamics Using Bayesian Clustering
Abstract. This paper introduces a Bayesian method for clustering dynamic processes and applies it to the characterization of the dynamics of a military scenario. The method models ...
Paola Sebastiani, Marco Ramoni, Paul R. Cohen, Joh...
MFCS
2009
Springer
14 years 5 days ago
Sampling Edge Covers in 3-Regular Graphs
An edge cover C of an undirected graph is a set of edges such that every vertex has an adjacent edge in C. We show that a Glauber dynamics Markov chain for edge covers mixes rapidl...
Ivona Bezáková, William A. Rummler
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 4 months ago
The Non-Bayesian Restless Multi-Armed Bandit: a Case of Near-Logarithmic Regret
In the classic Bayesian restless multi-armed bandit (RMAB) problem, there are N arms, with rewards on all arms evolving at each time as Markov chains with known parameters. A play...
Wenhan Dai, Yi Gai, Bhaskar Krishnamachari, Qing Z...