[HTML][HTML] Boltzmann samplers for first-order differential specifications
O Bodini, O Roussel, M Soria - Discrete Applied Mathematics, 2012 - Elsevier
In the framework of analytic combinatorics, Boltzmann models give rise to efficient
algorithms for the random generation of combinatorial objects. This paper proposes an …
algorithms for the random generation of combinatorial objects. This paper proposes an …
Shuffled languages—Representation and recognition
Language models that use interleaving, or shuffle, operators have applications in various
areas of computer science, including system verification, plan recognition, and natural …
areas of computer science, including system verification, plan recognition, and natural …
Biased Boltzmann samplers and generation of extended linear languages with shuffle
A Darrasse, K Panagiotou… - Discrete Mathematics …, 2012 - dmtcs.episciences.org
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 …
distributions, and uses stochastic bias on the parameter of a Boltzmann sampler, to produce …
Enumeration and random generation of concurrent computations
O Bodini, A Genitrini… - Discrete Mathematics & …, 2012 - dmtcs.episciences.org
In this paper, we study the shuffle operator on concurrent processes (represented as trees)
using analytic combinatorics tools. As a first result, we show that the mean width of shuffle …
using analytic combinatorics tools. As a first result, we show that the mean width of shuffle …
Statistical analysis of non-deterministic fork-join processes
We study the combinatorial structure of concurrent programs with non-deterministic choice
and a fork-join style of coordination. As a first step we establish a link between these …
and a fork-join style of coordination. As a first step we establish a link between these …
A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space
We study concurrent processes with non-deterministic choice, loops and a fork-join style of
coordination under the lens of combinatorics. As a starting point, we interpret these …
coordination under the lens of combinatorics. As a starting point, we interpret these …
[PDF][PDF] Statistical Analysis of Non-Deterministic Fork-Join Processes
F Peschanski - wkerl.me
We study the combinatorial structure of concurrent programs with non-deterministic choice
and a fork-join style of coordination. As a first step we establish a link between these …
and a fork-join style of coordination. As a first step we establish a link between these …
[PDF][PDF] Statistical Analysis of Non-Deterministic Fork-Join Processes
Statistical Analysis of Non-Deterministic Fork-Join Processes Page 1 Statistical Analysis of
Non-Deterministic Fork-Join Processes Martin Pépin Joint work with Antoine Genitrini & Frédéric …
Non-Deterministic Fork-Join Processes Martin Pépin Joint work with Antoine Genitrini & Frédéric …
[PDF][PDF] Boltzmann-Sampling von kombinatorischen Strukturen
C Ringelhahn - 2017 - dmg.tuwien.ac.at
Diese Arbeit behandelt das Problem der effizienten Erzeugung von Objekten
kombinatorischer Strukturen. Diese Generatoren, sogenannte Boltzmann-Sampler …
kombinatorischer Strukturen. Diese Generatoren, sogenannte Boltzmann-Sampler …
[PDF][PDF] Camille Combier
M Christophe - 2012 - liris.cnrs.fr
Résumé Une carte généralisée est un modèle topologique permettant de représenter
implicitement un ensemble de cellules (sommets, arêtes, faces, volumes,...) ainsi que …
implicitement un ensemble de cellules (sommets, arêtes, faces, volumes,...) ainsi que …