• redbKIT

  • Referenced in 255 articles [sw12977]
  • their fundamental theoretical properties, discusses the related algorithmic and implementation aspects, and highlights their built ... constructing accurate RB spaces using greedy algorithms and proper orthogonal decomposition techniques, investigate their approximation...
  • BILUM

  • Referenced in 50 articles [sw04015]
  • convergence of multigrid methods. The multi-level algorithms implemented by BILUM are based ... independent set is found by some greedy algorithms such that each block is decoupled with...
  • GRASP

  • Referenced in 133 articles [sw01094]
  • Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP (greedy...
  • ADMiRA

  • Referenced in 35 articles [sw31664]
  • rank matrix and extending efficient greedy algorithms from the vector to the matrix case...
  • foba

  • Referenced in 30 articles [sw35840]
  • package foba - greedy variable selection. foba is a package that implements forward, backward, and foba ... sparse learning algorithms for ridge regression, described ... paper ”Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations...
  • CELF++

  • Referenced in 23 articles [sw11772]
  • CELF++: optimizing the greedy algorithm for influence maximization in social networks...
  • T-coffee

  • Referenced in 41 articles [sw13195]
  • serious pitfalls caused by the greedy nature of this algorithm. With T-Coffee...
  • GESPAR

  • Referenced in 30 articles [sw25722]
  • refer to as GESPAR: GrEedy Sparse PhAse Retrieval. Our algorithm does not require matrix lifting...
  • SOPRA

  • Referenced in 8 articles [sw12607]
  • short reads. The main focus of the algorithm is selecting a sufficiently large subset ... reads, the ad hoc greedy algorithms used in the earlier studies are likely to lead...
  • DIALIGN-TX

  • Referenced in 7 articles [sw12751]
  • DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment. Background: DIALIGN ... multiple-alignment program DIALIGN. Due to several algorithmic improvements, it produces significantly better alignments ... DIALIGN-T uses a a straight-forward greedy approach to assemble multiple alignments from local ... DIALIGN-T that combines our previous greedy algorithm with a progressive alignment approach...
  • CoFIM

  • Referenced in 4 articles [sw31052]
  • submodular, based on which a greedy algorithm was proposed to give a near-optimal solution ... However, this simple greedy algorithm is time consuming, which limits its application on large-scale...
  • BART-BMA

  • Referenced in 5 articles [sw23498]
  • forests, a machine learning algorithm which grows trees using a greedy search for the best ... predictions. We propose an alternative fitting algorithm for BART called BART-BMA, which ... uses Bayesian model averaging and a greedy search algorithm to obtain a posterior distribution more...
  • TIFIM

  • Referenced in 4 articles [sw31050]
  • corresponding methods for influence maximization, including greedy algorithms, heuristic algorithms and their extensions to determine...
  • AAA

  • Referenced in 46 articles [sw36858]
  • Even on a disk or interval the algorithm may outperform existing methods, and on more ... interpolation at certain support points and (2) greedy selection of the support points to avoid ... based on (1). We present the core algorithm with a Matlab code and nine applications...
  • DSJM

  • Referenced in 6 articles [sw12532]
  • segments compression algorithms.The DSJM implements a greedy partitioning algorithm after the sparse matrix has been...
  • GAGA

  • Referenced in 2 articles [sw12223]
  • GAGA: GPU Accelerated Greedy Algorithms. Welcome to GAGA, a software package for solving large compressed ... release GAGA 1.1.0 consists of ten greedy algorithms using five matrix ensembles. This release...
  • CHAC

  • Referenced in 3 articles [sw02760]
  • resources while maximizing safety. Unlike previous MOACO algorithms, CHAC uses a single colony ... different degrees of difficulty), outperforming a greedy algorithm (taken as baseline), and yielding a good...
  • SelvarClustMV

  • Referenced in 3 articles [sw12566]
  • account missing values. It is a greedy algorithm associated to the SR modeling proposed...
  • GreedEx

  • Referenced in 1 article [sw08623]
  • method for the active learning of greedy algorithms. Greedy algorithms constitute an apparently simple algorithm ... aimed at promoting active learning of greedy algorithms. The method is focused on the concept...
  • MULKNAP

  • Referenced in 38 articles [sw06467]
  • present a branch-and-bound algorithm to solve this problem to optimality. We employ ... with the lower bound obtained by a greedy heuristic, we apply the pegging test ... this type of problems, and our algorithm inherits this weakness as well...