• simannf90

  • Referenced in 119 articles [sw05059]
  • optimization. The algorithm is essentially an iterative random search procedure with adaptive moves along ... first local minima encountered. The new method proved to be more reliable than the others ... Nelder-Mead method and the adaptive random search method of the reviewer), being always able...
  • GMRFLib

  • Referenced in 309 articles [sw06641]
  • comprehensive reference on the subject.par Gaussian Markov Random Fields: Theory and Applications provides such ... introducing them to this powerful statistical inference method...
  • copula

  • Referenced in 145 articles [sw07944]
  • Archimedean copulas are implemented, with methods for density/distribution evaluation, random number generation, and graphical display...
  • copula

  • Referenced in 167 articles [sw14499]
  • some more copula families. Methods for density, distribution, random number generation, bivariate dependence measures, perspective...
  • PRISM

  • Referenced in 442 articles [sw01186]
  • which combines both symbolic and sparse matrix methods. PRISM has been successfully used to analyse ... properties for a range of systems, including randomized distributed algorithms, manufacturing systems and workstation clusters...
  • Scatter Search

  • Referenced in 293 articles [sw05291]
  • methods for creating new solutions afford significant benefits beyond those derived from recourse to randomization...
  • Ziggurat

  • Referenced in 45 articles [sw10535]
  • Ziggurat Method for Generating Random Variables. We provide a new version of our ziggurat method...
  • GLLAMM

  • Referenced in 62 articles [sw06517]
  • Algorithm (ml with method d0). In the case of discrete random effects or factors ... continuous (multivariate) normal random effects or factors. Two methods are available for numerical integration: Quadrature...
  • rnorrexp

  • Referenced in 35 articles [sw26153]
  • Ziggurat Method for Generating Random Variables. We provide a new version of our ziggurat method...
  • lobpcg.m

  • Referenced in 144 articles [sw24008]
  • able to compare numerically different methods in the class, with different preconditioners, we propose ... common system of model tests, using random preconditioners and initial guesses. As the “ideal” control ... advocate the standard preconditioned conjugate gradient method for finding an eigenvector as an element...
  • QSIMVN

  • Referenced in 148 articles [sw32329]
  • method used by the Fortran MVNDST software, but the quasi-random integration point...
  • BartPy

  • Referenced in 83 articles [sw40584]
  • which uses dimensionally adaptive random basis elements. Motivated by ensemble methods in general, and boosting...
  • AS 159

  • Referenced in 40 articles [sw14170]
  • efficient method of generating random RxC tables with given row and column totals. (Algorithm...
  • Walksat

  • Referenced in 209 articles [sw04328]
  • normal form. They start by assigning a random value to each variable. If the assignment ... satisfied. WalkSAT and GSAT differ in the methods used to select which variable to flip ... with some probability picks a variable at random. WalkSAT first picks a clause which...
  • BayesTree

  • Referenced in 64 articles [sw07995]
  • BayesTree: Bayesian Methods for Tree Based Models: Implementation of BART: Bayesian Additive Regression Trees ... which uses dimensionally adaptive random basis elements. Motivated by ensemble methods in general, and boosting...
  • GUI-HDMR

  • Referenced in 22 articles [sw07924]
  • controlled, then a quasi-random sampling method is preferable. This guarantees that the input space ... covered more uniformly than by using random values and it provides a better convergence rate...
  • QMC4PDE

  • Referenced in 23 articles [sw33945]
  • QMC4PDE: Quasi-Monte Carlo methods for elliptic PDEs with random diffusion coefficients. A practical guide ... quasi-Monte Carlo methods to elliptic PDEs with random diffusion coefficients – a survey of analysis...
  • CubeHash

  • Referenced in 13 articles [sw07100]
  • CubeHash-5/96. The second method randomizes the search for highly probable linear differential trails...
  • ASKIT

  • Referenced in 11 articles [sw17470]
  • ASKIT is based on a novel, randomized method for efficiently factoring off-diagonal blocks...
  • Jellyfish

  • Referenced in 29 articles [sw12431]
  • implements a projected incremental gradient method with a biased, random ordering of the increments. This...