• Algorithm 769

  • Referenced in 15 articles [sw13886]
  • Fortran subroutine for approximate solution of sparse quadratic assignment problem using GRASP. We describe Fortran ... finding approximate solutions of sparse instances of the quadratic assignment problem using a greedy randomized...
  • Expokit

  • Referenced in 189 articles [sw00258]
  • toolkit is capable of coping with sparse matrices of large dimension. The software handles real ... general matrix exponentials, a distinct attention is assigned to the computation of transient states...
  • FPC_AS

  • Referenced in 66 articles [sw12218]
  • recovering sparse solutions to an undetermined system of linear equations Ax=b. The algorithm ... algorithm in a continuation (homotopy) approach by assigning a decreasing sequence of values ... speed and its ability to recover sparse signals...
  • VieM

  • Referenced in 1 article [sw19377]
  • VieM v1.00 -- Vienna Mapping and Sparse Quadratic Assignment User Guide. This paper severs ... mapping framework VieM (Vienna Mapping and Sparse Quadratic Assignment). We give a rough overview...
  • Soft-LOST

  • Referenced in 7 articles [sw14921]
  • points assigned to them. This method, combined with a transformation into a sparse domain...
  • NCDawareRank

  • Referenced in 2 articles [sw28411]
  • problems caused by the sparseness of the link graph and assigns more reasonable ranking scores...
  • tpSpMV

  • Referenced in 1 article [sw38268]
  • multicore and manycore architectures based on Compressed Sparse Row (CSR) format via row-wise parallelization ... overwhelmed by assignments to long rows of large-scale sparse matrices; (b) irregular accesses...
  • LVC

  • Referenced in 1 article [sw22727]
  • term-based approach to static single assignment that leverages that SSA is functional programming (Appel ... realize SSA-based optimizations, in particular sparse conditional constant propagation (Wegman, Zadeck) and SSA-based...
  • M-DPOP

  • Referenced in 3 articles [sw02790]
  • social choice problem, the goal is to assign values, subject to side constraints ... reusability decreases from almost 100% for very sparse problems to around 20% for highly connected...
  • TBCI

  • Referenced in 0 articles [sw05458]
  • many Matrix classes providing specializations for different sparse matrices. They all feature a similar interface ... which are treated differently with respect to assignment and copy...
  • BARON

  • Referenced in 339 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • complib

  • Referenced in 32 articles [sw00149]
  • COMPlib: COnstraint matrix-optimization problem library–a collection...
  • Coq

  • Referenced in 1856 articles [sw00161]
  • Coq is a formal proof management system. It...
  • CSDP

  • Referenced in 202 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...
  • EIGIFP

  • Referenced in 43 articles [sw00235]
  • eigifp is a MATLAB program for computing a...
  • GAP

  • Referenced in 3068 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • LANCELOT

  • Referenced in 304 articles [sw00500]
  • LANCELOT. A Fortran package for large-scale nonlinear...
  • LAPACK

  • Referenced in 1677 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • LEDA

  • Referenced in 262 articles [sw00509]
  • In the core computer science areas -- data structures...
  • Magma

  • Referenced in 3137 articles [sw00540]
  • Computer algebra system (CAS). Magma is a large...