This paper is devoted to the construction of Boltzmann samplers according to various distributions, and uses stochastic bias on the parameter of a Boltzmann sampler, to produce a sampler with a different distribution for the size of the output. As a significant application, we produce Boltzmann samplers for words defined by regular specifications containing shuffle operators and linear recursions. This sampler has linear complexity in the size of the output, where the complexity is measured in terms of real-arithmetic operations and evaluations of generating functions
International audienceBoltzmann models from statistical physics, combined with methods from analytic...
W pracy tej przedstawiamy ogólną, matematycznie poprawną, łatwą w użyciu i dość wydajną implementacj...
International audienceThe Boltzmann model for the random generation of ''decomposable'' combinatoria...
This paper is devoted to the uniform generation of words produced by regular specifications containi...
Uniform random generation is a central issue in combinatorics. Indeed, random sampling is virtually ...
Randomly generating structured objects is important in testing and optimizing functional programs, w...
AbstractIn the framework of analytic combinatorics, Boltzmann models give rise to efficient algorith...
In the framework of analytic combinatorics, Boltzmann models give rise to efficient algorithms for t...
This article proposes a surprisingly simple framework for the random generation of combinatorial con...
This note proposes a new framework for random generation of combinatorial configurations based on wh...
Boltzmann samplers introduced by Duchon et al. in 2001 is a method by which to automatically build r...
International audienceWe address the uniform random generation of words from a context-free language...
Boltzmann samplers are a kind of random samplers; in 2004, Duchon, Flajolet, Louchard and Schaeffer ...
Boltzmann models from statistical physics combined with methods from analytic combinatorics give ris...
Colloque avec actes et comité de lecture. internationale.International audienceThis note proposes a ...
International audienceBoltzmann models from statistical physics, combined with methods from analytic...
W pracy tej przedstawiamy ogólną, matematycznie poprawną, łatwą w użyciu i dość wydajną implementacj...
International audienceThe Boltzmann model for the random generation of ''decomposable'' combinatoria...
This paper is devoted to the uniform generation of words produced by regular specifications containi...
Uniform random generation is a central issue in combinatorics. Indeed, random sampling is virtually ...
Randomly generating structured objects is important in testing and optimizing functional programs, w...
AbstractIn the framework of analytic combinatorics, Boltzmann models give rise to efficient algorith...
In the framework of analytic combinatorics, Boltzmann models give rise to efficient algorithms for t...
This article proposes a surprisingly simple framework for the random generation of combinatorial con...
This note proposes a new framework for random generation of combinatorial configurations based on wh...
Boltzmann samplers introduced by Duchon et al. in 2001 is a method by which to automatically build r...
International audienceWe address the uniform random generation of words from a context-free language...
Boltzmann samplers are a kind of random samplers; in 2004, Duchon, Flajolet, Louchard and Schaeffer ...
Boltzmann models from statistical physics combined with methods from analytic combinatorics give ris...
Colloque avec actes et comité de lecture. internationale.International audienceThis note proposes a ...
International audienceBoltzmann models from statistical physics, combined with methods from analytic...
W pracy tej przedstawiamy ogólną, matematycznie poprawną, łatwą w użyciu i dość wydajną implementacj...
International audienceThe Boltzmann model for the random generation of ''decomposable'' combinatoria...