TERMIUM Plus^®

Record 1,  Textual support,  English

Record number: 1, Textual support number: 1 CONT

The key to developing a parallel inference algorithm is to exploit or introduce independencies. In the sequential Monte Carlo samplers, this independence can lead to high variance in the resulting estimate. In [other algorithms], the independence is only achieved by introducing approximations.  2, record 1, English, - parallel%20inference%20algorithm

Record 1,  Textual support,  French

Record 1,  Textual support,  Spanish

Record 2,  Textual support,  English

Record number: 2, Textual support number: 1 CONT

A randomized algorithm is called a Monte Carlo algorithm if it may fail or return incorrect answers, but has runtime independent of the randomness.  2, record 2, English, - Monte%20Carlo%20algorithm

Record 2,  Textual support,  French

Record number: 2, Textual support number: 1 CONT

[...] algorithmes de Monte-Carlo : l'algorithme peut se tromper[,] mais on connaît la probabilité qu'il donne la bonne réponse [...]  2, record 2, French, - algorithme%20de%20Monte%2DCarlo

Record 2,  Textual support,  Spanish

Record number: 2, Textual support number: 1 CONT

El método de Montecarlo es una técnica numérica para calcular probabilidades y otras cantidades relacionadas, utilizando secuencias de números aleatorios.  1, record 2, Spanish, - algoritmo%20de%20Montecarlo

Record 3,  Textual support,  English

Record number: 3, Textual support number: 1 CONT

There are also tree traversal algorithms that classify as neither depth-first search nor breadth-first search. One such algorithm is Monte Carlo tree search, which concentrates on analyzing the most promising moves, basing the expansion of the search tree on random sampling of the search space.  2, record 3, English, - tree%20search%20algorithm

Record 3,  Textual support,  French

Record number: 3, Textual support number: 1 CONT

Les techniques de propagation de contraintes sont utilisées pour réduire la taille de l'espace de recherche lors de la résolution d'un problème de satisfaction de contraintes par un algorithme de recherche arborescente.  3, record 3, French, - algorithme%20de%20recherche%20arborescente

Record 3,  Textual support,  Spanish

Record 4,  Textual support,  English

Record number: 4, Textual support number: 1 CONT

We present a new Monte Carlo lattice model to study the folding of two-dimensional heteropolymer chains. Previous lattice model studies of two-dimensional chains have been performed on square grids using predefined "move sets" of allowed moves. The motion of the polymer chain in these models is thus highly constrained. To add greater flexibility, we use a triangular lattice and allow the chain to choose its own moves. Physically unrealistic moves are prevented by including kinetic energy effects in the Metropolis algorithm. From the results, we can characterize all of the possible one-and two-monomer moves and sort them according to relative importance. Greater flexibility in the lattice model produces several significant and interesting physical consequences.  1, record 4, English, - Monte%20Carlo%20lattice%20model

Record 4,  Textual support,  French

Record number: 4, Textual support number: 1 CONT

Aperçu sur les méthodes de modélisation [...] Monte Carlo sur réseau : la diffusion des atomes par mécanisme lacunaire est décrite par des sauts atomiques discrets plutôt que par des trajectoires continues comme dans le cas de la dynamique moléculaire. Les fréquences des sauts des atomes sont déterminées par des calculs ab initio ou par la dynamique moléculaire. Cette simulation est relativement lente et ne prend pas en compte les déplacements collectifs.  1, record 4, French, - Monte%20Carlo%20sur%20r%C3%A9seau

Record 4,  Textual support,  Spanish