Results 11  20
of
2,582
Tiling groups for Wang tiles
 PROCEEDINGS OF THE 13 TH ANNUAL ACMSIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA) SIAM EDS
"... We apply tiling groups and height functions to tilings of regions in the plane by Wang tiles, which are squares with colored boundaries where the colors of shared edges must match. We define a set of tiles as unambiguous if it contains all tiles equivalent to the identity in its tiling group. For al ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We apply tiling groups and height functions to tilings of regions in the plane by Wang tiles, which are squares with colored boundaries where the colors of shared edges must match. We define a set of tiles as unambiguous if it contains all tiles equivalent to the identity in its tiling group
Niching Methods for Genetic Algorithms
, 1995
"... Niching methods extend genetic algorithms to domains that require the location and maintenance of multiple solutions. Such domains include classification and machine learning, multimodal function optimization, multiobjective function optimization, and simulation of complex and adaptive systems. This ..."
Abstract

Cited by 232 (1 self)
 Add to MetaCart
Niching methods extend genetic algorithms to domains that require the location and maintenance of multiple solutions. Such domains include classification and machine learning, multimodal function optimization, multiobjective function optimization, and simulation of complex and adaptive systems. This study presents a comprehensive treatment of niching methods and the related topic of population diversity. Its purpose is to analyze existing niching methods and to design improved niching methods. To achieve this purpose, it first develops a general framework for the modelling of niching methods, and then applies this framework to construct models of individual niching methods, specifically crowding and sharing methods. Using a constructed model of crowding, this study determines why crowding methods over the last two decades have not made effective niching methods. A series of tests and design modifications results in the development of a highly effective form of crowding, called determin...
Mixing for Markov Chains and Spin Systems
 LECTURES GIVEN AT THE 2005 PIMS SUMMER SCHOOL IN PROBABILITY HELD AT THE UNIVERSITY OF BRITISH COLUMBIA FROM JUNE 6 THROUGH JUNE 30.
, 2005
"... ..."
An Interruptible Algorithm for Perfect Sampling via Markov Chains
 Annals of Applied Probability
, 1998
"... For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution # on an enormously large state space, but elementary sampling is ruled out by the infeasibility of calculating an appropriate nor ..."
Abstract

Cited by 92 (7 self)
 Add to MetaCart
normalizing constant. The same difficulty arises in computer science problems where one seeks to sample randomly from a large finite distributive lattice whose precise size cannot be ascertained in any reasonable amount of time. The Markov chain Monte Carlo (MCMC) approximate sampling approach to such a
Exact Sampling with Markov Chains
, 1996
"... Random sampling has found numerous applications in computer science, statistics, and physics. The most widely applicable method of random sampling is to use a Markov chain whose steady state distribution is the probability distribution ß from which we wish to sample. After the Markov chain has been ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Random sampling has found numerous applications in computer science, statistics, and physics. The most widely applicable method of random sampling is to use a Markov chain whose steady state distribution is the probability distribution ß from which we wish to sample. After the Markov chain has been
Abstract Tiling groups for Wang tiles ∗
"... We apply tiling groups and height functions to tilings of regions in the plane by Wang tiles, which are squares with colored boundaries where the colors of shared edges must match. We define a set of tiles as unambiguous if it contains all tiles equivalent to the identity in its tiling group. For al ..."
Abstract
 Add to MetaCart
We apply tiling groups and height functions to tilings of regions in the plane by Wang tiles, which are squares with colored boundaries where the colors of shared edges must match. We define a set of tiles as unambiguous if it contains all tiles equivalent to the identity in its tiling group
Rapidly Mixing Markov Chains with Applications in Computer Science and Physics
, 2006
"... Monte Carlo algorithms often depend on Markov chains to sample from very large data sets. A key ingredient in the design of an efficient Markov chain is determining rigorous bounds on how quickly the chain “mixes,” or converges, to its stationary distribution. This survey provides an overview of sev ..."
Abstract

Cited by 33 (0 self)
 Add to MetaCart
Monte Carlo algorithms often depend on Markov chains to sample from very large data sets. A key ingredient in the design of an efficient Markov chain is determining rigorous bounds on how quickly the chain “mixes,” or converges, to its stationary distribution. This survey provides an overview
How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
 JOURNAL OF ALGORITHMS
, 1998
"... A general problem in computational probability theory is that of generating a random sample from the state space of a Markov chain in accordance with the steadystate probability law of the chain. Another problem is that of generating a random spanning tree of a graph or spanning arborescence of a d ..."
Abstract

Cited by 110 (7 self)
 Add to MetaCart
A general problem in computational probability theory is that of generating a random sample from the state space of a Markov chain in accordance with the steadystate probability law of the chain. Another problem is that of generating a random spanning tree of a graph or spanning arborescence of a
Results 11  20
of
2,582