• CDSChecker

  • Referenced in 5 articles [sw21725]
  • memory model. We develop several novel techniques for modeling the relaxed behaviors allowed...
  • CompCertTSO

  • Referenced in 12 articles [sw08230]
  • surprisingly subtle by several factors: the relaxed-memory behavior of the hardware, the effects ... desire for a reasonably simple programming model. In turn, this complexity makes verified compilation both...
  • FastGCN

  • Referenced in 9 articles [sw38089]
  • graph model for semi-supervised learning. This model, however, was originally designed to be learned ... time and memory challenges for training with large, dense graphs. To relax the requirement ... effectiveness compared with GCN and related models. In particular, training is orders of magnitude more...
  • sPuReMD

  • Referenced in 6 articles [sw12865]
  • scaling in system size, and a low memory footprint. sPuReMD is a freely distributed software ... model diverse systems ranging from oxidative stress in biomembranes to strain relaxation...
  • AGGJE

  • Referenced in 4 articles [sw07163]
  • disadvantage of meshfree methods is that their memory requirement and computational cost are much higher ... free Galerkin (EFG) approach. A compact mathematical model of heat transfer problems is first established ... Based on the widely used Successive Over-Relaxation-Preconditioned Conjugate Gradient (SSOR-PCG) scheme ... boundary values. Numerical results show that the memory requirement of the FastPCG solver is only...
  • FastPCG

  • Referenced in 4 articles [sw07164]
  • disadvantage of meshfree methods is that their memory requirement and computational cost are much higher ... free Galerkin (EFG) approach. A compact mathematical model of heat transfer problems is first established ... Based on the widely used Successive Over-Relaxation-Preconditioned Conjugate Gradient (SSOR-PCG) scheme ... boundary values. Numerical results show that the memory requirement of the FastPCG solver is only...
  • picasso

  • Referenced in 3 articles [sw20406]
  • Computationally efficient tools for fitting generalized linear model with convex or non-convex penalty. Users ... Computation is handled by multi-stage convex relaxation and the PathwIse CAlibrated Sparse Shooting algOrithm ... with optimal statistical properties. The computation is memory-optimized using the sparse matrix output...
  • 2LEV-D2P4

  • Referenced in 11 articles [sw00009]
  • We present a package of parallel preconditioners which...
  • ALPS

  • Referenced in 17 articles [sw00036]
  • This paper describes the design of the Abstract...
  • AMD

  • Referenced in 61 articles [sw00039]
  • Algorithm 837: AMD is a set of routines...
  • Apron

  • Referenced in 71 articles [sw00045]
  • Apron: a library of numerical abstract domains for...
  • ATLAS

  • Referenced in 199 articles [sw00056]
  • This paper describes the Automatically Tuned Linear Algebra...
  • BARON

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

  • Referenced in 200 articles [sw00086]
  • BoomerAMG: A parallel algebraic multigrid solver and preconditioner...
  • cdd

  • Referenced in 119 articles [sw00114]
  • The program cdd+ (cdd, respectively) is a C...
  • CGAL

  • Referenced in 402 articles [sw00118]
  • The goal of the CGAL Open Source Project...
  • Coq

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

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

  • Referenced in 115 articles [sw00203]
  • As modern programming methodologies migrate from computer science...