• Aucun résultat trouvé

perfect sampling

Perfect sampling of Jackson Queueing Networks

Perfect sampling of Jackson Queueing Networks

... of sampling from their exact stationary distribution. We show that perfect sampling is possible, although the underlying Markov chain may have an infinite state ...the sampling time of this ...

36

Perfect sampling for multiclass closed queueing networks

Perfect sampling for multiclass closed queueing networks

... the perfect sampling algorithm directly, as one must first enumerate all the state space in order to compute a ...the perfect sampling algorithm in finite expected time, and the complexity of ...

19

Algorithms and applications of the Monte Carlo method : Two-dimensional melting and perfect sampling

Algorithms and applications of the Monte Carlo method : Two-dimensional melting and perfect sampling

... Copyright c  EPLA 2010 Introduction – Chaos manifests itself in Hamiltonian dynamical systems when any two nearby initial configu- rations drift apart with time. Chaos can also be defined for cellular automata and for ...

161

A perfect sampling algorithm of random walks with forbidden arcs

A perfect sampling algorithm of random walks with forbidden arcs

... Lemma 1 ( [Propp and Wilson, 1996]). Under the foregoing assumptions, the output of Algo- rithm P SA(Y ) is distributed according to the stationary distribution of Y (n), if the algorithm terminates. A naive ...

27

Perfect sampling algorithm for Schur processes

Perfect sampling algorithm for Schur processes

... Bijective sampling of Schur processes Exact sampling algorithms based on partition processes for classes of tilings including plane and skew plane partitions [2] (see also [4] for a general approach and [3] ...

27

Perfect samplers for mixtures of distributions

Perfect samplers for mixtures of distributions

... a perfect sampler for mixtures of distributions, in the spirit of Mira and Roberts (1999), building on Hobert, Robert and Titterington ...iid sampling method for mixture posterior distributions and ...

13

On the NP-Completeness of the Perfect Perfect Matching Free Subgraph Problem

On the NP-Completeness of the Perfect Perfect Matching Free Subgraph Problem

... three sets of the partition consists of a perfect matching. In order to show the NP-completeness of TSSPMP, we shall use the one-in-three 3SAT problem. An instance of one-in-three 3SAT (1-in-3 3SAT) consists of n ...

14

Perfect Brewster transmission through ultrathin perforated films

Perfect Brewster transmission through ultrathin perforated films

... two perfect transmissions; this is attributable to a deeper exci- tation of the evanescent field in these regions which would require to conduct the model at higher orders (see Appendix ...

20

Odd perfect polynomials over ${\mathbb{F}_2}$

Odd perfect polynomials over ${\mathbb{F}_2}$

... of perfect polynomial was introduced by Canaday [1], the first doctoral student of Leonard ...odd perfect polynomial in F2 [x] must be a ...even perfect polynomials ...

11

Perfect unary forms over real quadratic fields

Perfect unary forms over real quadratic fields

... on perfect unary forms over real quadratic ...relate perfect unary forms over F to well-rounded forms over ...of perfect unary forms for F = Q( √ d) for positive squarefree integers d ≤ ...10,732,735 ...

18

Patent Office in innovation policy: Nobody's perfect

Patent Office in innovation policy: Nobody's perfect

... High-R&D pooling equilibria are also characterized by a signicant R&D activity, but the process of granting patents cannot rely on self-screening and only rests on the imperfect exam- ination. So, some obvious ...

36

The strongly perfect lattices of dimension $10$

The strongly perfect lattices of dimension $10$

... up to dimension 9 and for dimension 11. Up to similarity they are root lattices of types Al, A2, D4, E6, E7, E8 and their duals (~Ven~). There are no such lattices in dimensions 3, 5, 9, and 11. In this paper we classify ...

17

Perfect Failure Detection with Very Few Bits

Perfect Failure Detection with Very Few Bits

... The perfect failure detector provides accurate and eventually complete information about process ...systems, perfect failure detection can be achieved by an oracle that outputs at most ⌈log α(n)⌉ + 1 bits ...

19

Stiffness modeling of non-perfect parallel manipulators

Stiffness modeling of non-perfect parallel manipulators

... the perfect kinematic chains, their end-points may be aligned and matched in the same target point t 0 , which corresponds to the desired end-platform lo- ...

9

The Labeled perfect matching in bipartite graphs

The Labeled perfect matching in bipartite graphs

... said perfect if it covers the vertex set of G. In the labeled perfect matching problem (Labeled P M in short), we are given a simple graph G = (V, E) on |V | = 2n vertices which contains a perfect ...

11

Pliable rejection sampling

Pliable rejection sampling

... importance sampling and makes the problem of adaptive rejection sampling significantly more challenging than the problem of adaptive importance ...rejection sampling ( PRS ), a simple variation of ...

17

Impact of Sampling-Source Extinction Ratio in Linear Optical Sampling

Impact of Sampling-Source Extinction Ratio in Linear Optical Sampling

... Abstract— We report on the impact of the sampling-source extinction ratio (ER) in a linear optical sampling system. To this effect, an analytical model is developed and contrasted with experimental data and ...

5

Perfect spin filtering by symmetry in molecular junctions

Perfect spin filtering by symmetry in molecular junctions

... ( 2015 )], we explore the generality of the proposed mechanism and the degree of achieved spin-polarized current for realistic molecular junctions made of various ferromagnetic electrodes (Ni, Co, Fe) connected by ...

7

Extending a perfect matching to a Hamiltonian cycle

Extending a perfect matching to a Hamiltonian cycle

... a perfect matching in K Q d to a Hamiltonian ...a perfect matching M in K Q d , we may extend this to a Hamiltonian cycle adding only edges from certain subcubes, depending on M ...every perfect ...

15

From variable density sampling to continuous sampling using Markov chains

From variable density sampling to continuous sampling using Markov chains

... easily be extended to a 3D framework by considering a different neighbourhood of each k-space location. Existing continuous trajectories in CS-MRI only exploit 1D or 2D randomness for 2D or 3D k-space sampling, ...

5

Show all 657 documents...

Sujets connexes