Results 221 to 230 of about 595,374 (265)
Some of the next articles are maybe not open access.
GENERICITY AND RANDOMNESS WITH ITTMS
The Journal of Symbolic Logic, 2019AbstractWe study genericity and randomness with respect to ITTMs, continuing the work initiated by Carl and Schlicht. To do so, we develop a framework to study randomness in the constructible hierarchy. We then answer several of Carl and Schlicht’s question. We also ask a new question one the equality of two classes of randoms.
Benoît Monin +1 more
openaire +1 more source
Generating Fullerenes at Random
Journal of Chemical Information and Computer Sciences, 1996In the present paper a method for generating fullerenes at random is presented. It is based on the well known Stone−Wales (SW) transformation. The method could be further generalized so that other trivalent polyhedra with prescribed properties are generated.
Bor Plestenjak +2 more
openaire +2 more sources
International Journal of Theoretical Physics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Skřivánek, Václav, Frič, Roman
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Skřivánek, Václav, Frič, Roman
openaire +2 more sources
A calculus of random generation
1993A systematic approach to the random generation of labelled combinatorial objects is presented. It applies to structures that are decomposable, i.e., formally specifiable by grammars involving union, product, set, sequence, and cycle constructions. A general strategy is developed for solving the random generation problem with two closely related types ...
Flajolet, Philippe +2 more
openaire +1 more source
Generating triangulations at random
ACM Transactions on Modeling and Computer Simulation, 1994An O(n 3 ) algorithm is described to count triangulations of a simple polygon with n vertices. This algorithm is used to construct an O(n 4 ) algorithm to ...
Peter Epstein, Jörg-Rüdiger Sack
openaire +1 more source
Software: Practice and Experience, 2008
AbstractAs the use of computer simulation grows in a variety of science and engineering fields, the quality of random variate generators becomes increasingly important. Unfortunately, a number of standard implementations are grossly inadequate and exhibit poor statistical properties.
openaire +1 more source
AbstractAs the use of computer simulation grows in a variety of science and engineering fields, the quality of random variate generators becomes increasingly important. Unfortunately, a number of standard implementations are grossly inadequate and exhibit poor statistical properties.
openaire +1 more source
Computers and Biomedical Research, 1968
Abstract A commonly used uniform random-number generator is examined in light of a genetic-simulation problem. Although this generator is often useful, it proves defective in this case. The author suggests that any proposed generator be checked for the properties needed by the simulation problem at hand.
openaire +2 more sources
Abstract A commonly used uniform random-number generator is examined in light of a genetic-simulation problem. Although this generator is often useful, it proves defective in this case. The author suggests that any proposed generator be checked for the properties needed by the simulation problem at hand.
openaire +2 more sources
Random Number Generation [PDF]
, 2011 The fields of probability and statistics are built over the abstract concepts of probability space and random variable. This has given rise to elegant and powerful mathematical theory, but exact implementation of these concepts on conventional computers seems impossible.
openaire +2 more sources
Generating Random Points in a Tetrahedron
Journal of Graphics Tools, 2000Summary: This paper proposes a simple and efficient technique to generate uniformly random points in a tetrahedron. The technique generates random points in a cube and folds the cube into the barycentric space of the tetrahedron in a way that preserves uniformity.
Cignoni P, Rocchini C
openaire +8 more sources