• Neurofitter

  • Referenced in 12 articles [sw09289]
  • detail several popular search algorithms, including brute-force methods, simulated annealing, genetic algorithms, evolution strategies...
  • DSTool

  • Referenced in 103 articles [sw06719]
  • ordinary differential equations. The methods employed by the theory of dynamical systems allow to compute ... directly without the need for long brute-force simulations...
  • BioGAP

  • Referenced in 4 articles [sw08793]
  • beyond the limits of simple brute-force methods. In this talk we describe...
  • biOps

  • Referenced in 2 articles [sw08208]
  • also provided (standard, kd-tree and brute force methods implemented). Fast Fourier Transform methods...
  • DOST

  • Referenced in 7 articles [sw13155]
  • method is orders-of-magnitude faster than the brute-force DOST, and they demonstrate that...
  • polyominoes

  • Referenced in 1 article [sw34499]
  • backtracking and other refinements of `brute-force’ techniques, our method is based on a systematic...
  • MathCheck

  • Referenced in 9 articles [sw13642]
  • systems and SAT solvers. We present a method and an associated system, called MathCheck, that ... combination relative to finite brute-force search. (new: MathCheck2: A SAT+CAS Verifier for Combinatorial...
  • kamila

  • Referenced in 1 article [sw16426]
  • This package implements KAMILA clustering, a novel method for clustering mixed-type data ... Modha-Spangler clustering, which uses a brute-force strategy to maximize the cluster separation simultaneously...
  • changepointsHD

  • Referenced in 1 article [sw26719]
  • given user specified black-box models. The methods include binary segmentation for multiple change-point ... point the package includes simulated annealing, brute force, and, for Gaussian graphical models, an application...
  • Minlog

  • Referenced in 2 articles [sw30424]
  • calculus formulation of these systems. While the method it uses is rather unsophisticated, on small ... represents what can be done by brute force rather than intelligence. The decision problem...
  • PAG2ADMG

  • Referenced in 1 article [sw18039]
  • this possible. We introduce PAG2ADMG, the first method for enumerating all causal graphs consistent with ... demonstrate its efficiency relative to brute-force enumeration...
  • Mapper

  • Referenced in 1 article [sw36044]
  • graph, which gives, as a byproduct, a method to automatically tune its parameters and compute ... most stable ones in the brute-force setting, which is widely used in visualization, clustering...
  • KDTREE

  • Referenced in 3 articles [sw18200]
  • logN) time instead of the brute-force O(N) time, with N being the size ... taken in the implementation of the search methods, resulting in substantially higher computational efficiency...
  • NeuroVectorizer

  • Referenced in 1 article [sw32381]
  • framework to support multiple supervised learning methods. We evaluate our approaches against the currently used ... only 3% worse than the brute-force search on a wide range of benchmarks...
  • UMDA/S

  • Referenced in 1 article [sw24583]
  • value of the optimization parameter by brute force. Considering it as a nonlinear global optimization ... excellent parameters, as compared to existing static methods and search algorithms...
  • HSEARCH

  • Referenced in 0 articles [sw18391]
  • sequence motifs are computational intensive. Most existing methods are not fast enough to analyze large ... HSEARCH is significantly faster than the brute force algorithm for protein motif finding and achieves...
  • TRIC

  • Referenced in 47 articles [sw02165]
  • TRIC is a simple but sophisticated 3-node...
  • CUDA

  • Referenced in 1185 articles [sw03258]
  • The NVIDIA® CUDA® Toolkit provides a comprehensive development...
  • AS 32

  • Referenced in 4 articles [sw03816]
  • Algorithm AS 32. The incomplete gamma integral. ...
  • AS 2

  • Referenced in 4 articles [sw03828]
  • Algorithm AS 2. The normal integral. ...