• PSwarm

  • Referenced in 58 articles [sw00742]
  • arbitrary starting points. In the (optional) search step of coordinate search, the algorithm incorporates ... handle general linear constraints. The poll step now incorporates positive generators for the tangent cone ... provision for the degenerate case. The search step has also been adapted accordingly. In particular ... particle swarm used in the search step is computed by first inscribing an ellipsoid...
  • TRON

  • Referenced in 105 articles [sw04714]
  • gradient projection method to generate a Cauchy step, a preconditioned conjugate gradient method with ... direction, and a projected search to compute the step. The use of projected searches...
  • J-MEANS

  • Referenced in 64 articles [sw02649]
  • uses J-Means in its local search step, is proposed too. Results on standard test ... that J-Means outperforms the other local search methods, quite substantially when many entities...
  • LPG

  • Referenced in 12 articles [sw20690]
  • planning graph representing partial plans. The search steps are certain graph modifications transforming an action ... planning graph to define the search neighborhood and to evaluate its elements using a parametrized ... search after a certain number of search steps and ”restarts” have been performed. Finally...
  • CFSQP

  • Referenced in 59 articles [sw04658]
  • Armijo type arc search is used with the property that the step ... achieved by means of a ”nonmonotone” search along a straight line. The merit function used...
  • SDPT3

  • Referenced in 569 articles [sw04009]
  • with either the HKM or the NT search direction. The basic code is written ... algorithm are incorporated. For example, step-lengths associated with semidefinite cones are calculated...
  • POMDPS

  • Referenced in 34 articles [sw03055]
  • decision step during the execution. Online algorithms generally consist of a lookahead search to find ... best action to execute at each time step in an environment. Our objectives here ... that state-of-the-art online heuristic search methods can handle large POMDP domains efficiently...
  • NeNMF

  • Referenced in 22 articles [sw17586]
  • performed on a smartly chosen search point, where the step size is determined ... does not use the time consuming line search and converges optimally at rate in optimizing...
  • BLAST++

  • Referenced in 2 articles [sw08824]
  • observation that the seed searching step of BLAST is a bottleneck that consumes more than ... virtual query so that the seed searching step needs to be performed only once...
  • MISQPN

  • Referenced in 3 articles [sw07057]
  • outer approximation supported by mixed-integer search steps...
  • ImplicitLNLMethods

  • Referenced in 4 articles [sw23184]
  • Euler, under a certain time-step restriction. The search for high order strong stability preserving...
  • glcCluster

  • Referenced in 1 article [sw07545]
  • default), glcFast or glcSolve, for global search (Step 1). Step 2 is an adaptive clustering ... initial point for a local search (Step 3). The 4th step ... best point, a local search is finally made as Step 5 with the new best...
  • evtree

  • Referenced in 7 articles [sw14304]
  • build the model in a forward stepwise search. Although this approach is known ... homogeneity at the next step only. An alternative way to search over the parameter space...
  • GATE

  • Referenced in 5 articles [sw06442]
  • regulates the mean step and the permitted search area of the GAs’ random search operators...
  • ESyPred3D

  • Referenced in 3 articles [sw16876]
  • generally consists in four steps: (1) databanks searching to identify the structural homolog, (2) target ... model evaluation. The target–template alignment step is generally accepted as the most critical step...
  • SeqGAN

  • Referenced in 4 articles [sw26534]
  • intermediate state-action steps using Monte Carlo search. Extensive experiments on synthetic data and real...
  • Nek5000

  • Referenced in 46 articles [sw08064]
  • considers the linearised Navier--Stokes equations and searches for growing small disturbances, i.e. so-called ... using matrix-free methods adopting the time-stepping Arnoldi approach. We present here our implementation...
  • GOLEM

  • Referenced in 51 articles [sw24695]
  • achieves this efficiency because it avoids searching a large hypothesis space for consistent hypotheses ... clause obtained in the first construction step. Again, the rlgg with the greatest coverage...
  • MiRFinder

  • Referenced in 3 articles [sw29577]
  • tool consisted of two major steps: 1) genome wide search for hairpin candidates...
  • FASTA

  • Referenced in 22 articles [sw09655]
  • joining initial regions. The results of searches with FASTA compare favorably with results using ... protein-coupled receptor family. The joining step by FASTA to calculate the initn score ... task. In many cases, a FASTA sequence search will result in a list of high...