Results 181 to 190 of about 1,714 (207)

Random particle packing by reduced dimension algorithms

Journal of Applied Physics, 1990
A new type of Monte Carlo algorithm to calculate packing fraction and general particle dispersion characteristics for arbitrary random packs of spherical particles is presented. Given arbitrary quantities of arbitrary sizes with arbitrary mass densities, the algorithms calculate the close random packing fraction.
I. Lee Davis, Roger G. Carter
openaire   +1 more source

Randomized and deterministic algorithms for the dimension of algebraic varieties

Proceedings 38th Annual Symposium on Foundations of Computer Science, 2002
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale model of computation over C, that it admits a s/sup O(1)/D/sup O(n)/ deterministic algorithm, and that for systems with integer coefficients it is in the Arthur-Merlin class ...
openaire   +1 more source

Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions

Computer Aided Geometric Design, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

A biased random key genetic algorithm for open dimension nesting problems using no-fit raster

Expert Systems with Applications, 2017
Irregular 2D cutting problems with one or two open dimensions are tackled.The no-fit raster concept is extended to deal with free form items.A BRKGA combined with bottom-left heuristics is proposed to solve the problems.It outperforms recent methods from the literature on different set of instances.Instances with items as circles, convex and non-convex
Leandro Resende Mundim, Marina Andretta, Thiago Alves de Queiroz   +2 more
openaire   +1 more source

Molecular trajectory algorithm for random walks on percolation systems at criticality in two and three dimensions

Physica A: Statistical Mechanics and its Applications, 2012
Abstract Random walk simulations based on a molecular trajectory algorithm are performed on critical percolation clusters. The analysis of corrections to scaling is carried out. It has been found that the fractal dimension of the random walk on the incipient infinite cluster is d w = 2.873 ± 0.008 in two dimensions and 3.78 ± 0.02 in
Wei Cen, Dongbing Liu, Bingquan Mao
openaire   +1 more source

Moonpool dimensions and position optimization with Genetic Algorithm of a drillship in random seas

Ocean Engineering, 2022
Lucas do Vale Machado, Antonio Carlos Fernandes   +1 more
openaire   +1 more source

Searching for evidence of algorithmic randomness and incomputability in the output of quantum random number generators

Physics Letters, Section A: General, Atomic and Solid State Physics, 2021
Maximilian Schlosshauer
exaly  

On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness

International Journal of Approximate Reasoning, 2022
Floris Persiau, Jasper de Bock, Gert De Cooman   +2 more
exaly  

Randomized Algorithm for Approximate Nearest Neighbor Search in High Dimensions

Journal of Pattern Recognition Research, 2014
Ruben Buaba, Abdollah Homaifar, William Hendrix, Seung Son, Wei-keng Liao, Alok Choudhary   +5 more
openaire   +1 more source

Algorithmic randomness and layerwise computability

2020
Mathieu Hoyrup, Johanna N Y Franklin, Christopher P Porter   +2 more
exaly