• APMC

  • Referenced in 27 articles [sw11483]
  • Approximate probabilistic model checking. Symbolic model checking methods have been extended recently to the verification ... model checking algorithm. In this paper, we propose an approximation method to verify quantitative properties ... Markov chains. We give a randomized algorithm to approximate the probability that a property expressed ... confidence by a probabilistic system. Our randomized algorithm requires only a succinct representation...
  • sobol.cc

  • Referenced in 50 articles [sw36024]
  • quasirandom sequence generator. An algorithm to generate Sobol’ sequences to approximate integrals ... previously given by Bratley and Fox in Algorithm 659. Here, we provide more primitive polynomials ... allow the generation of Sobol’ sequences to approximate integrals in up to 1111 dimensions...
  • TNPACK

  • Referenced in 39 articles [sw00970]
  • constraints by a truncated Newton algorithm. The algorithm is especially suited for problems involving ... number of variables. Truncated Newton methods allow approximate, rather than exact, solutions to the Newton ... using the preconditioned Conjugate Gradient algorithm (PCG) to solve approximately the Newton equations. The preconditioner...
  • UnitWalk

  • Referenced in 34 articles [sw00993]
  • also prove that our algorithm is probabilistically approximately complete...
  • PSAPSR

  • Referenced in 26 articles [sw28496]
  • Fast Algorithms for Approximating the Pseudospectral Abscissa and Pseudospectral Radius. A MATLAB package for approximating...
  • CirCut

  • Referenced in 42 articles [sw04782]
  • Goemans--Williamson randomized algorithm guarantees a high-quality approximation to the MAX-CUT problem ... cost associated with such an approximation can be excessively high for large-scale problems ... codes that implement the Goemans--Williamson randomized algorithm, as well as with a purely heuristic ... higher approximation quality in practice than that of the Goemans--Williamson randomized algorithm. An extension...
  • TREESPH

  • Referenced in 64 articles [sw14217]
  • with a hierarchical tree algorithm. Multiple expansions are used to approximate the potential of distant...
  • TANE

  • Referenced in 38 articles [sw02196]
  • TANE: An efficient algorithm for discovering functional and approximate dependencies. environments. The discovery of functional ... analysis technique. We present TANE, an efficient algorithm for finding functional dependencies from large databases ... partitions also makes the discovery of approximate functional dependencies easy and efficient and the erroneous ... magnitude over previously published results. The algorithm is also applicable to much larger datasets than...
  • HypE

  • Referenced in 50 articles [sw19794]
  • HypE: an algorithm for fast hypervolume-based many-objective optimization. In the field of evolutionary ... Pareto dominance: whenever a Pareto set approximation entirely dominates another one, then the indicator value ... indicator’s potential; current hypervolume-based search algorithms are limited to problems with only ... fast search algorithm that uses Monte Carlo simulation to approximate the exact hypervolume values...
  • FRSDE

  • Referenced in 15 articles [sw08762]
  • density estimator using minimal enclosing ball approximation. Reduced Set Density Estimator (RSDE) is an important ... shortcoming, a Fast Reduced Set Density Estimator algorithm (FRSDE) is proposed in this study. First ... fast core-set based MEB approximation algorithm is introduced to develop the proposed algorithm FRSDE...
  • ADMiRA

  • Referenced in 31 articles [sw31664]
  • minimum rank solution satisfying a prescribed data approximation bound. We propose an atomic decomposition providing ... rank matrix and extending efficient greedy algorithms from the vector to the matrix case ... efficient and guaranteed algorithm named atomic decomposition for minimum rank approximation (ADMiRA) that extends Needell ... Tropp’s compressive sampling matching pursuit (CoSaMP) algorithm from the sparse vector...
  • RRQR

  • Referenced in 21 articles [sw04673]
  • main contribution is an efficient block algorithm for approximating an RRQR factorization, employing a windowed ... strategy and improved versions of the RRQR algorithms for triangular matrices orginally suggersted by Chandrasekaran...
  • toms/782

  • Referenced in 21 articles [sw05211]
  • main contribution is an efficient block algorithm for approximating an RRQR factorization, employing a windowed ... improved versions of the RRQR algorithms for triangular matrices originally suggested by {it S. Chandrasekaran...
  • ANN

  • Referenced in 45 articles [sw09854]
  • supports data structures and algorithms for both exact and approximate nearest neighbor searching in arbitrarily...
  • SPGL1

  • Referenced in 159 articles [sw08365]
  • BPDN) fits the least-squares problem only approximately, and a single parameter determines a curve ... BPDN. We describe a root-finding algorithm for finding arbitrary points on this curve ... algorithm is suitable for problems that are large scale and for those that ... each iteration, a spectral gradient-projection method approximately minimizes a least-squares problem with...
  • NLPQLP

  • Referenced in 40 articles [sw04073]
  • programming (SQP) method. Proceeding from a quadratic approximation of the Lagrangian function and a linearization ... properties of the SQP algorithm remain satisfied. The Hessian approximation is updated by the modified...
  • SDPHA

  • Referenced in 40 articles [sw02214]
  • However, the homogeneous algorithms generally take fewer iterations to compute an approximate solution within...
  • TOMS659

  • Referenced in 128 articles [sw10686]
  • Algorithm 659: Implementing Sobol’s quasirandom sequence generator: TOMS659 is a FORTRAN77 library which computes ... more useful for such tasks as approximation of integrals in higher dimensions, and in global ... sample space ”more uniformly” than random numbers. Algorithms that use such sequences may have superior...
  • P2MESH

  • Referenced in 12 articles [sw00665]
  • specific model problems or built-in approximation algorithms. The software package is general purpose...
  • FISHPAK

  • Referenced in 92 articles [sw08012]
  • Algorithm 541. FISHPAK: A package of Fortran subprograms for the solution of separable elliptic partial ... solve second- and fourth-order finite difference approximations to separable elliptic Partial Differential Equations (PDEs ... equations. The solvers use the cyclic reduction algorithm. When the problem is singular, a least ... FISHPACK. MUDPACK uses multigrid iteration to approximate separable and nonseparable elliptic PDEs. The software...