• ADBASE

  • Referenced in 64 articles [sw08460]
  • problem genertion and the computation of efficient extreme points in multiple objective linear programming. This ... looks at the task of computing efficient extreme points in multiple objective linear programming. Vector ... ADBASE solver for computing all efficient extreme points of a multiple objective linear program ... paper, the numbers of efficient extreme points possessed by MOLPs (including multiple objective transportation problems...
  • cdd

  • Referenced in 119 articles [sw00114]
  • generating all vertices (i.e. extreme points) and extreme rays of a general convex polyhedron given ... real dimensional vector. See, [FP96] for an efficient implementation of the double description method which ... convex hull of a finite set of points and the nonnegative hull of a finite...
  • GPGPU

  • Referenced in 20 articles [sw09105]
  • commodity video cards has evolved into an extremely powerful and flexible processor. Modern graphics architectures ... that support vector operations and IEEE floating point precision. High-level languages have emerged ... provide insight into how to build efficient GPGPU algorithms. Finally we present...
  • FastXML

  • Referenced in 9 articles [sw30152]
  • label space. FastXML is an efficient tree ensemble based extreme classifier that can scale ... make predictions in milliseconds per test point. Tree ensembles generally require...
  • QPALM

  • Referenced in 6 articles [sw35397]
  • convergence of such iterations to a stationary point at an R-linear rate ... exact linesearch. The former can be computed efficiently in most iterations by making ... resulting implementation is shown to be extremely robust in numerical simulations, solving ... Maros-Meszaros problems and finding a stationary point for most of the nonconvex...
  • EVPI

  • Referenced in 20 articles [sw02644]
  • dynamic problems, including the simplex and interior-point methods and nested Benders decomposition, which decomposes ... such problems to improve their parallel solution efficiency by increasing the size of the nodes ... EVPI) is developed which is applicable to extremely large multistage stochastic linear programmes which either...
  • ADMM_QAP

  • Referenced in 9 articles [sw31756]
  • programming, SDP, relaxations have proven to be extremely strong for many hard discrete optimization problems ... There are several difficulties that arise in efficiently solving the SDP relaxation, e.g., increased dimension ... inefficiency of the current primal–dual interior point solvers in terms of both time...
  • fclencurt

  • Referenced in 2 articles [sw22525]
  • File Exchange 6911. fclencurt: This extremely fast and efficient algorithm uses MATLAB’s ifft routine ... routine appears optimal for 2^N+1 points. Running on an average laptop, this routine...
  • CompPD

  • Referenced in 7 articles [sw24188]
  • Tukey (1975), depth functions have proved extremely useful in robust data analysis and inference ... possess very high breakdown point robustness and infinite sample relative efficiency. However, the computation...
  • AnyBubble

  • Referenced in 8 articles [sw31804]
  • Traditional shooting methods fail because of the extreme non-linearity of field evolution over ... finding solutions which is both very efficient and able to cope with the non-linearities ... except at a small number of junction points, so we do not need to introduce...
  • Pindel

  • Referenced in 4 articles [sw33143]
  • pattern growth approach to detect break points of large deletions and medium sized insertions from ... identification of long structural variations is extremely challenging. Results: We present Pindel, a pattern growth ... reads and real data to demonstrate the efficiency of the computer program and accuracy...
  • CayMos

  • Referenced in 2 articles [sw17439]
  • tree-decomposable linkages, part I: Extreme points, continuous motion paths and minimal representations” (2011; arXiv ... complexity” (2011; arXiv:1112.6009)] to implement efficient algorithmic solutions for (a) meaningfully representing and visualizing...
  • MolAxis

  • Referenced in 3 articles [sw35343]
  • MolAxis: Efficient and Accurate Identification of Channels in Macromolecules. Channels and cavities play important roles ... molecule is the collection of points that have more than one closest atom ... problem and consequently rendering the algorithm extremely efficient. MolAxis is designed to identify channels that...
  • SpaceHub

  • Referenced in 1 article [sw38106]
  • bits floating point machine precision, has the ability to handle extremely eccentric orbits and close ... long-term integrations. AR-ABITS, a bit efficient arbitrary precision method, achieves any precision with...
  • COPOD

  • Referenced in 1 article [sw41889]
  • each given data point to determine its level of ”extremeness”. Intuitively, we think of this ... both parameter-free, highly interpretable, and computationally efficient. In this work, we make three...
  • Algorithm 954

  • Referenced in 3 articles [sw20214]
  • applications. We report on an accurate and efficient algorithm for obtaining all roots of general ... class, a fast convergent Newton-Raphson starting point for a real root is obtained ... cubic solver in getting information about stationary points and, when the quartic has real roots ... Newton-Raphson iterations give one of the extreme real roots. The remaining roots follow...
  • GScan

  • Referenced in 1 article [sw39247]
  • quadrilateral formed by four extreme points, sort the remaining points according to the angles ... proposed preprocessing approach to further discard interior points. We finally obtain the desired convex hull ... calculating the convex hull of the remaining points. We strongly exploit the parallel sorting, reduction ... provided by the library Thrust for better efficiency and simplicity. Comparative results indicate that...
  • Symmetrizer

  • Referenced in 1 article [sw41258]
  • nearly symmetric molecules. Symmetry is an extremely useful and powerful tool in computational chemistry, both ... point groups of perfectly symmetric molecules are well-known, finding the closest point group ... molecule’s symmetry elements and closest matching point groups based on a user-adjustable tolerance ... point groups. We explain this approach in detail, and assess the flexibility, robustness, and efficiency...
  • BQPD

  • Referenced in 1 article [sw06198]
  • When Q is indefinite, a Kuhn-Tucker point that is usually a local solution ... sparsity in Q can be exploited. An extreme case occurs when ... situation, so that it also provides an efficient method for linear programming...
  • ANSYS

  • Referenced in 715 articles [sw00044]
  • ANSYS offers a comprehensive software suite that spans...