Sciweavers

511 search results - page 8 / 103
» Lower bounds for distributed markov chain problems
Sort
View
IOR
2008
91views more  IOR 2008»
13 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...
IJAR
2007
100views more  IJAR 2007»
13 years 7 months ago
Multisensor triplet Markov chains and theory of evidence
Hidden Markov chains (HMC) are widely applied in various problems occurring in different areas like Biosciences, Climatology, Communications, Ecology, Econometrics and Finances, ...
Wojciech Pieczynski
ICDCS
1995
IEEE
13 years 11 months ago
Analysis of Resource Lower Bounds in Real-Time Applications
Tasks in a real-time application usually have several stringent timing, resource, and communication requirements. Designing a distributed computing system which can meet all these...
Raed Alqadi, Parameswaran Ramanathan
JUCS
2008
158views more  JUCS 2008»
13 years 7 months ago
A Linear Time Approximation Algorithm for Ruler Folding Problem
: A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ru...
Ali Nourollah, Mohammadreza Razzazi
GECCO
2007
Springer
210views Optimization» more  GECCO 2007»
14 years 1 months ago
Markov chain models of bare-bones particle swarm optimizers
We apply a novel theoretical approach to better understand the behaviour of different types of bare-bones PSOs. It avoids many common but unrealistic assumptions often used in an...
Riccardo Poli, William B. Langdon