• Paramils

  • Referenced in 70 articles [sw00678]
  • describe an automatic framework for this algorithm configuration problem. More formally, we provide methods ... performance on a given class of problem instances by varying a set of ordinal and/or ... family of local-search-based algorithm configuration procedures and present novel techniques for accelerating them...
  • irace

  • Referenced in 87 articles [sw08008]
  • main purpose is to automatically configure optimization algorithms by finding the most appropriate settings given ... instances of an optimization problem. It builds upon the race package by Birattari ... implemented in R. Keywords: automatic configuration, offline tuning, parameter tuning, racing, F-race. Relevant literature ... irace package, Iterated Race for Automatic Algorithm Configuration. Technical Report TR/IRIDIA/2011-004, IRIDIA, Université libre...
  • xAct

  • Referenced in 58 articles [sw07598]
  • Mathematica. xAct implements state-of-the-art algorithms for fast manipulations of indices ... General Relativity. It is highly programmable and configurable. Since its first public release in March ... solved a number of hard problems...
  • GlobSol

  • Referenced in 38 articles [sw06724]
  • solutions to unconstrained and constrained global optimization problems. After briefly reviewing some of these techniques ... first overall description of GlobSol’s algorithm. Giving advice on use, we point out strengths ... approaches. Through examples, we show how to configure and use GlobSol...
  • KORBX

  • Referenced in 55 articles [sw04341]
  • both hardware, which uses parallel processing technology configured with 256 MB of memory, and software ... KORBX linear programming software system contains four algorithms which are variations of the interior point ... primal, dual, primal-dual, and power series algorithms were empirically evaluated ... calibration purposes, a set of smaller test problems were also run using MPSX...
  • RealPaver

  • Referenced in 50 articles [sw04401]
  • Algorithm 852 Realpaver: nonlinear constraint solving & rigorous global optimization. Problems: Realpaver allows modeling and solving ... nonlinear and nonconvex constraint satisfaction and optimization problems over the real numbers. The decision variables ... covers the solution set of a given problem by means of rectangular regions from ... real Euclidean space. It can prove the problem insatisfiability by calculating an empty covering. Under...
  • METCO

  • Referenced in 6 articles [sw19036]
  • problems and evolutionary algorithms, and facilitates tool maintenance. A wide variety of configuration options ... cooperation of a set of evolutionary algorithms. The aim of the new model ... most current evolutionary algorithms operate. This way, a wider range of problems can be tackled ... demonstrated by configuring standard and self-adaptive models for test problems and real-world applications...
  • EdgePack

  • Referenced in 24 articles [sw00229]
  • proposed to choose the best data configuration in terms of processing phase time according ... codes using iterative solvers in unstructured grid problems. This method is realized as a suite ... techniques and variations of matrix-vector product algorithm. Results have been demonstrating the great flexibility ... distributed memory platforms in which different data configurations can coexist...
  • iOpt

  • Referenced in 8 articles [sw00448]
  • synthesis and evaluation of a variety of algorithms. In addition to these, the toolkit incorporates ... problem and scheduling models, and also for monitoring the run-time behaviour and configuring ... parameters of heuristic search algorithms...
  • Elastix

  • Referenced in 15 articles [sw11747]
  • collection of algorithms that are commonly used to solve medical image registration problems. The modular ... elastix allows the user to quickly configure, test, and compare different registration methods...
  • COBRA

  • Referenced in 26 articles [sw02211]
  • algorithm to assess stability against ideal ballooning modes in general three-dimensional magnetic configurations ... performs this assessment by solving an eigenvalue problem in the form of a linear second...
  • OptorSim

  • Referenced in 21 articles [sw09653]
  • Data Grids mostly deal with large computational problems that in turn require evaluating and mining ... access. par Within this paper, several replication algorithms are studied. This is achieved using ... strategies can be studied under different Grid configurations. The goal is to explore the stability...
  • PRONTO 2D

  • Referenced in 13 articles [sw18327]
  • algorithm is described which greatly improves stability as well as performance in plasticity problems ... PRONTO are cast in an unrotated configuration defined using the rotation determined from the polar ... deformation gradient. An accurate incremental algorithm was developed to determine this rotation and is described...
  • Schittkowski

  • Referenced in 27 articles [sw05205]
  • area of numerical methods for optimization problems that are needed to compute parameters ... least square fit. The mathematical configurations that must be provided by the system analyst ... book contains a CD with numerical algorithms presented in the book giving to the reader...
  • DISCO

  • Referenced in 7 articles [sw13152]
  • free graph realization problems: An SDP-based divide-and-conquer algorithm for large-scale noisy ... free graph realization. We propose the DISCO algorithm for graph realization in ℝ d , given ... distances as inputs. Our divide-and-conquer algorithm works as follows. When a group ... configurations are improved by gradient descent refinement. The algorithm is applied to the problem...
  • pertsaus2

  • Referenced in 17 articles [sw15442]
  • constitutes a serious computational problem. This paper presents an algorithm that implements Simulated Annealing ... point-wise translations to locate the optimal configuration. Explicit implementation details are given for least...
  • mplp2

  • Referenced in 6 articles [sw21188]
  • framework for designing algorithms for finding the most probable (MAP) configuration in graphical models. However ... many real-world inference problems, the typical decomposition has a large integrality ... consistency. Earlier work showed that cluster-pursuit algorithms, which iteratively introduce cycle and other higherorder...
  • Chordal

  • Referenced in 5 articles [sw27125]
  • efficient algorithms for several problems in computational algebraic geometry. See installation and configuration for instructions...
  • JCLEC

  • Referenced in 16 articles [sw08869]
  • user interface that allows users to configure an algorithm, to execute it interactively ... study: the resolution of the 0/1 knapsack problem by means of evolutionary algorithms...
  • bmds

  • Referenced in 12 articles [sw27804]
  • deal with two major problems in metric multidimensional scaling-configuration of objects and determination ... object configuration-within a Bayesian framework. A Markov chain Monte Carlo algorithm is proposed...