• Genocop

  • Referenced in 1099 articles [sw04707]
  • system aims at finding a global optimum (minimum or maximum: this...
  • mftoolbox

  • Referenced in 612 articles [sw23743]
  • contain the core algorithmic aspects with a minimum of inessential code. In particular, the following...
  • EGO

  • Referenced in 393 articles [sw07588]
  • points. Then, EGO balances between finding the minimum of the surface and improving the approximation...
  • Code Tables

  • Referenced in 250 articles [sw28701]
  • various types of codes. Bounds on the minimum distance of linear codes and quantum codes...
  • EMD

  • Referenced in 231 articles [sw14902]
  • user. The EMD is defined as the minimum amount of work needed to change...
  • MPT

  • Referenced in 230 articles [sw04732]
  • starting from different performance objectives (linear, quadratic, minimum time) to the handling of systems with...
  • NETGEN

  • Referenced in 148 articles [sw09229]
  • generating large scale capacitated assignment, transportation, and minimum cost flow network problems. The purpose ... generate capacitated and uncapacitated transportation and minimum cost flow network problems, and assignment problems...
  • SPGL1

  • Referenced in 196 articles [sw08365]
  • solutions. The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least...
  • NEURON

  • Referenced in 187 articles [sw03059]
  • subnet over an interval equal to the minimum (interprocessor) presynaptic spike generation to postsynaptic spike...
  • ve08

  • Referenced in 148 articles [sw05141]
  • only hope to locate a local minimum of f within the usual limitations on storage...
  • SDPLR

  • Referenced in 146 articles [sw04745]
  • SDPs) such as the MaxCut SDP, the Minimum Bisection SDP, and the (unweighted) Lovasz Theta...
  • gSpan

  • Referenced in 114 articles [sw11908]
  • maps each graph to a unique minimum DFS code as its canonical label. Based...
  • J-MEANS

  • Referenced in 72 articles [sw02649]
  • MEANS: A new local search heuristic for minimum sum of squares clustering. A new local ... Means, is proposed for solving the minimum sum of squares clustering problem. The neighborhood...
  • OTIS

  • Referenced in 86 articles [sw07763]
  • such as the brachistochrone and supersonic aircraft minimum-time-climb...
  • LIPSOL

  • Referenced in 84 articles [sw04712]
  • Barry Peyton at ORNL and a multiple minimum-degree ordering package by Joseph...
  • ROBPCA

  • Referenced in 68 articles [sw11592]
  • robust scatter matrix such as the minimum covariance determinant or an S-estimator...
  • AK-MCS

  • Referenced in 67 articles [sw18303]
  • structural reliability is to keep to a minimum the number of calls to the numerical...
  • levmar

  • Referenced in 64 articles [sw04809]
  • iterative technique that finds a local minimum of a function that is expressed...
  • ape

  • Referenced in 62 articles [sw04569]
  • several tools such as Mantel’s test, minimum spanning tree, generalized skyline plots, graphical exploration...
  • PRINCE

  • Referenced in 61 articles [sw13240]
  • that realizing decryption and encryption results in minimum additional costs. PRINCE is designed in such...