• e1071

  • Referenced in 90 articles [sw07985]
  • fuzzy clustering, support vector machines, shortest path computation, bagged clustering, naive Bayes classifier...
  • MCPLIB

  • Referenced in 96 articles [sw07894]
  • available by anonymous ftp. Computational results using the PATH solver covering all of these problems...
  • Graphs

  • Referenced in 104 articles [sw12277]
  • single-source (SSSP) and all-pairs shortest-path (APSP) problems: we are first presented with ... graph). A so-called preprocessing algorithm may compute certain information (a data structure or index ... this preprocessing step, applications may ask shortest-path or distance queries, which should be answered ... spatial networks, and reachability queries; and theoretical computer scientists analyze distance oracles and sparse spanners...
  • GAMESS

  • Referenced in 34 articles [sw03002]
  • Functional Theory approximation. Excited states can be computed by CI, EOM, or TD-DFT procedures ... optimization, transition state searches, or reaction path following. Computation of the energy hessian permits prediction...
  • COBRA

  • Referenced in 28 articles [sw02211]
  • computational time ?? Cobra: Parallel path following for computing the matrix pseudospectrum ?? Cobra: a package...
  • ALCON

  • Referenced in 34 articles [sw05315]
  • paper discusses methods for the computation of solution paths of a nonlinear system ... factorization of the Jacobian is computed only once and thereafter a rank-one update...
  • HOPLA

  • Referenced in 14 articles [sw02330]
  • which types express the form of computation path of which a process is capable...
  • Algorithm 447

  • Referenced in 134 articles [sw12877]
  • path between two vertices already on paths. (The start vertex can be specified dynamically ... when executed on a random access computer...
  • TSPTW

  • Referenced in 36 articles [sw04709]
  • perspective (find the best path). We show with extensive computational results that the synergy between...
  • PITA

  • Referenced in 17 articles [sw06950]
  • discriminating arguments and the computation of Viterbi paths. Furthermore, we show PITA to be competitive ... parameterized to PITA(COUNT) which computes the number of different explanations for a subgoal...
  • gglasso

  • Referenced in 16 articles [sw14361]
  • majorization-decent (BMD), for efficiently computing the solution paths of the group-lasso penalized least...
  • SOCS

  • Referenced in 121 articles [sw07737]
  • optimization, chemical process control and machine tool path definition. Sparse Nonlinear Programming exploits state ... solved efficiently on desktop computers. The Sparse Nonlinear Programming software is available as an integral...
  • elasticnet

  • Referenced in 12 articles [sw08181]
  • Principal Components. The Lasso solution paths can be computed by the same function. First version...
  • ENTWIFE

  • Referenced in 18 articles [sw04255]
  • used to compute solution branches, various bifurcation points, and paths of bifurcation points ... used to examine the stability of previously computed solutions using eigenvalue techniques.ENTWIFE uses the free...
  • TRACER

  • Referenced in 11 articles [sw09484]
  • infinite-length symbolic paths due to unbounded loops. TRACER computes interpolants (using weakest preconditions among...
  • New-HOPLA

  • Referenced in 3 articles [sw06992]
  • process describing the shape of the computation paths it can perform. Its transition semantics, bisimulation...
  • MaizeRouter

  • Referenced in 3 articles [sw15642]
  • cost deflation that provides our various path computation procedures with progressively more accurate (and less...
  • PARAMESH

  • Referenced in 97 articles [sw00677]
  • large and important class of computational models, those using structured, logically Cartesian meshes. The package ... provide them with an incremental evolutionary path for their code, converting it first to uniformly...
  • MKL

  • Referenced in 108 articles [sw06975]
  • power is to use a carefully optimized computing math library designed to harness that potential ... processor architectures by selecting the best code path for each...
  • LVMSR

  • Referenced in 2 articles [sw02374]
  • each receiver. The problem of computing such data distribution paths is NP-complete. This paper ... investigation shows that the multicast data paths computed by our algorithm can always satisfy...