511 search results - page 22 / 103 » Lower bounds for distributed markov chain problems |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov C...
CIMAGING
2008
13 years 9 months ago
2008
We present an algorithm to generate samples from probability distributions on the space of curves. Traditional curve evolution methods use gradient descent to find a local minimum...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
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...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper, we present an accurate throughput model of the IEEE 802.11e enhanced distributed coordination function (EDCF). Compared to the previous models, we newly consider...