Sciweavers

Share
IOR
2008
91views more  IOR 2008»
8 years 7 months ago
A Randomized Quasi-Monte Carlo Simulation Method for Markov Chains
We introduce and study a randomized quasi-Monte Carlo method for estimating the state distribution at each step of a Markov chain. The number of steps in the chain can be random an...
Pierre L'Ecuyer, Christian Lécot, Bruno Tuf...
DM
2006
91views more  DM 2006»
8 years 7 months ago
Fast perfect sampling from linear extensions
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
Mark Huber
DSP
2008
8 years 7 months ago
Extension of higher-order HMC modeling with application to image segmentation
In this work, we propose to improve the neighboring relationship ability of the Hidden Markov Chain (HMC) model, by extending the memory lengthes of both the Markov chain process ...
Lamia Benyoussef, Cyril Carincotte, Stéphan...
CORR
2010
Springer
189views Education» more  CORR 2010»
8 years 7 months ago
Approaching Throughput-optimality in Distributed CSMA Scheduling Algorithms with Collisions
Abstract--It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing n...
Libin Jiang, Jean C. Walrand
CORR
2010
Springer
174views Education» more  CORR 2010»
8 years 7 months ago
Hybrid Numerical Solution of the Chemical Master Equation
We present a numerical approximation technique for the analysis of continuous-time Markov chains that describe networks of biochemical reactions and play an important role in the ...
Thomas A. Henzinger, Maria Mateescu, Linar Mikeev,...
CORR
2010
Springer
162views Education» more  CORR 2010»
8 years 7 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
CORR
2010
Springer
110views Education» more  CORR 2010»
8 years 7 months ago
Mixing Time and Stationary Expected Social Welfare of Logit Dynamics
We study logit dynamics [3] for strategic games. At every stage of the game a player is selected uniformly at random and she is assumed to play according to a noisy best-response ...
Vincenzo Auletta, Diodato Ferraioli, Francesco Pas...
AMC
2008
99views more  AMC 2008»
8 years 7 months ago
Markov chain network training and conservation law approximations: Linking microscopic and macroscopic models for evolution
In this paper, a general framework for the analysis of a connection between the training of artificial neural networks via the dynamics of Markov chains and the approximation of c...
Roderick V. N. Melnik
ICML
2010
IEEE
8 years 8 months ago
Finite-Sample Analysis of LSTD
In this paper we consider the problem of policy evaluation in reinforcement learning, i.e., learning the value function of a fixed policy, using the least-squares temporal-differe...
Alessandro Lazaric, Mohammad Ghavamzadeh, Ré...
GECCO
2008
Springer
158views Optimization» more  GECCO 2008»
8 years 8 months ago
Convergence analysis of quantum-inspired genetic algorithms with the population of a single individual
In this paper, the Quantum-inspired Genetic Algorithms with the population of a single individual are formalized by a Markov chain model using a single and the stored best individ...
Mehrshad Khosraviani, Saadat Pour-Mozafari, Mohamm...
books