Sciweavers

3356 search results - page 126 / 672
» Determining Consensus Numbers
Sort
View
COMBINATORICS
2002
84views more  COMBINATORICS 2002»
13 years 10 months ago
Compositions of Random Functions on a Finite Set
If we compose sufficiently many random functions on a finite set, then the composite function will be constant. We determine the number of compositions that are needed, on average...
Avinash Dalal, Eric Schmutz
CORR
2000
Springer
100views Education» more  CORR 2000»
13 years 10 months ago
Perfect simulation from the Quicksort limit distribution
The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional...
Luc Devroye, James Allen Fill, Ralph Neininger
MOC
2000
94views more  MOC 2000»
13 years 10 months ago
Irreducibility testing over local fields
The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in Q((x))[y], th...
P. G. Walsh
JCC
2002
74views more  JCC 2002»
13 years 9 months ago
Improved RGF method to find saddle points
: The predictor-corrector method for following a reduced gradient (RGF) to determine saddle points [Quapp, W. et al., J Comput Chem 1998, 19, 1087] is further accelerated by a modi...
Michael Hirsch, Wolfgang Quapp
MOC
2002
78views more  MOC 2002»
13 years 9 months ago
A geometric theory for preconditioned inverse iteration applied to a subspace
ABSTRACT. The aim of this paper is to provide a convergence analysis for a preconditioned subspace iteration, which is designated to determine a modest number of the smallest eigen...
Klaus Neymeyr