Results 11 to 20 of about 115,275 (294)

Object grammars and random generation [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 1998
This paper presents a new systematic approach for the uniform random generation of combinatorial objects. The method is based on the notion of object grammars which give recursive descriptions of objects and generalize context-freegrammars.
I. Dutour, Jean-Marc Fedou
doaj   +6 more sources

Uniform Random Number Generators [PDF]

open access: yes1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274), 2002
This paper summarizes the current state-of-the-art on uniform random number generation for stochastic simulation. It recalls the basic ideas, discusses some linear methods and their theoretical analysis, and provides pointers to further details and to recommended implementations.
  +4 more sources

An Improvement of Random Node Generator for the Uniform Generation of Capacities

open access: yesAnnals of Mathematics and Artificial Intelligence, 2022
Capacity is an important tool in decision-making under risk and uncertainty and multi-criteria decision-making. When learning a capacity-based model, it is important to be able to generate uniformly a capacity. Due to the monotonicity constraints of a capacity, this task reveals to be very difficult.
Sun, Peiqi   +2 more
openaire   +6 more sources

A new generation tree for permutations, preserving the number of fixed points [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
We describe a new uniform generation tree for permutations with the specific property that, for most permutations, all of their descendants in the generation tree have the same number of fixed points.
Philippe Duchon, Romaric Duvignau
doaj   +1 more source

Quadratic exact-size and linear approximate-size random generation of planar graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2005
This extended abstract introduces a new algorithm for the random generation of labelled planar graphs. Its principles rely on Boltzmann samplers as recently developed by Duchon, Flajolet, Louchard, and Schaeffer.
Eric Fusy
doaj   +1 more source

Crosstalk Prediction in Twisted-Wire Pairs Based on Beetle Swarm Optimization Algorithm

open access: yesIEEE Access, 2021
In this paper, a new algorithm for predicting per unit length (p.u.l) parasitic parameters of transmission line is proposed. In the twisted-wire pair (TWP), different rotation degrees correspond to different parasitic parameters, which brings ...
Baoming Xiao   +5 more
doaj   +1 more source

Generating constrained random data with uniform distribution [PDF]

open access: yesJournal of Functional Programming, 2014
Abstract We present a technique for automatically deriving test data generators from a given executable predicate representing the set of values we are interested in generating. The distribution of these generators is uniform over values of a given size.
Koen Claessen   +2 more
openaire   +2 more sources

A chaos based image encryption algorithm using Rubik’s cube and prime factorization process (CIERPF)

open access: yesJournal of King Saud University: Computer and Information Sciences, 2022
A novel Rubik’s cube based pixel level scrambling and simple XOR based diffusion is proposed in this paper to safely transmit multimedia information (images) through an untrusted channel, such as adaptive image content (i.e., plain image related) based ...
R. Vidhya, M. Brindha
doaj   +1 more source

Numerical solution for two-dimensional partial differential equations using SM’s method

open access: yesOpen Physics, 2022
In this research paper, the authors aim to establish a novel algorithm in the finite difference method (FDM). The novel idea is proposed in the mesh generation process, the process to generate random grids.
Mastoi Sanaullah   +5 more
doaj   +1 more source

Complex Dynamical Sampling Mechanism for the Random Pulse Circulation Model and Its Application

open access: yesMathematics, 2023
The fast multi-pulse spectrum is a spectrum acquisition method that obtains an average pulse amplitude in a dynamic window, which improves the energy resolution by sharpening peaks in the acquired spectra, but produces the counting loss.
Lin Tang, Kaibo Shi, Songke Yu
doaj   +1 more source

Home - About - Disclaimer - Privacy