Results 311 to 320 of about 5,213,227 (370)
Some of the next articles are maybe not open access.

Random Graph Processes with Degree Restrictions

Combinatorics, Probability and Computing, 1992
Suppose that a process begins with n isolated vertices, to which edges are added randomly one by one so that the maximum degree of the induced graph is always bounded above by d. We prove that if n → ∞ with d fixed, then with probability tending to 1, the final result of this process is a graph with ⌊nd / 2⌋ edges.
Ruciński, A., Wormald, N. C.
openaire   +1 more source

The Random Restriction Technique

2002
Oracle construction is a major tool for studying questions about complexity classes. Suppose we find an oracle relative to which a complexity-theoretic property Q holds and another oracle relative to which Q does not hold. Then we can conclude that settling the question of whether Q holds without assumption is very tough, in the sense that proof ...
Lane A. Hemaspaandra, Mitsunori Ogihara
openaire   +1 more source

Implementing unequal randomization in clinical trials with heterogeneous treatment costs

Statistics in Medicine, 2019
Equal randomization has been a popular choice in clinical trial practice. However, in trials with heterogeneous variances and/or variable treatment costs, as well as in settings where maximization of every trial participant's benefit is an important ...
O. Sverdlov, Y. Ryeznik
semanticscholar   +1 more source

Common Randomization Restrictions

2009
The examples presented in Chapters 1 and 2 were either unreplicated full factorial designs with random assignment of treatment combinations to runs or they were replicated experiments obtained without any restriction to run order. Some experiments are too large to be run effectively in this manner.
openaire   +1 more source

Global Matching of Random Restriction Maps

Methodology And Computing In Applied Probability, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Classification by restricted random walks

Pattern Recognition, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schöll, Joachim   +1 more
openaire   +2 more sources

Restricted Randomization in Randomized Controlled Trials-Reply

JAMA: The Journal of the American Medical Association, 1995
In Reply. —We thank Drs ter Riet and Kessels for attempting to explain the similar sample sizes we found in treatment and control groups. Unfortunately, their suggestion of widespread use of a form of restricted randomization does not shed any new light on our findings. In our original article, we stated, "The strong tendency for the comparison groups
openaire   +1 more source

Restricted random walks on graphs

Theoretica Chimica Acta, 1995
In the first part of this contribution we outline the construction of a novel matrix associated with a graph, the entries of which give the probability of a random walk over the graphG starting at sitei to reach sitej inD ij steps. HereD ij is the distance between verticesi, j.
openaire   +1 more source

Hadamard randomization: a valid restriction of random permuted blocks

Biometrical Journal, 2003
AbstractRandom permuted blocks can result in treatment imbalance if entry to the trial stops in mid‐block. This paper presents a restriction of this method of randomization. The restriction avoids severe treatment imbalance but gives unbiased estimators of the treatment difference and its variance.
R.A. Bailey, P.R. Nelson
openaire   +1 more source

Random Mappings with Restricted Preimages

2012
In this paper we refer to finite endofunctions where each image has at most r preimages as r-mappings. Probabilistic analysis of these mappings provides heuristics for problems arising in cryptography which involve similar but more complicated classes of mappings.
Andrew MacFie, Daniel Panario
openaire   +1 more source

Home - About - Disclaimer - Privacy