• p1afem

  • Referenced in 32 articles [sw08489]
  • almost linear complexity with respect to the runtime. Although the scope of this paper...
  • PROFIL/BIAS

  • Referenced in 133 articles [sw00733]
  • PROFIL (Programmer’s Runtime Optimized Fast Interval Library) is a C++ class library supporting ... vectors and matrices of these types, and complex numbers. PROFIL is based on BIAS (Basic...
  • OEuf

  • Referenced in 3 articles [sw27482]
  • producing exploitable code. Moreover, the OCaml runtime can be a burden for performance and fine ... compiled code does not require a complex runtime library, reducing the TCB, improving performance...
  • LoAT

  • Referenced in 3 articles [sw23213]
  • lower bounds on the worst-case runtime complexity of integer programs. To this...
  • GroupKit

  • Referenced in 24 articles [sw10570]
  • implementation complexity of groupware through the key features that comprise GroupKit. A runtime infrastructure automatically...
  • FoCaLiZe

  • Referenced in 10 articles [sw12384]
  • instance, the complex algorithms of the algebraic library provide runtime performances comparable to the best...
  • OBBTree

  • Referenced in 29 articles [sw33406]
  • efficient and exact interference detection amongst complex models undergoing rigid motion. The algorithm is applicable ... fitting oriented bounding box trees (OBBTrees). At runtime, the algorithm traverses two such trees ... accurately detect all the contacts between large complex geometries composed of hundreds of thousands...
  • Parsec

  • Referenced in 9 articles [sw22031]
  • environment for complex systems), its GUI, called Pave, and the portable runtime system that implements...
  • SA-cluster

  • Referenced in 9 articles [sw06867]
  • edge weight increments. Complexity analysis is provided to estimate how much runtime cost Inc-Cluster...
  • CrunchFlow

  • Referenced in 11 articles [sw13429]
  • options which can be selected at runtime. Using an automatic read of a thermodynamic ... used for reactive transport problems of arbitrary complexity and size (i.e., there...
  • QUARK

  • Referenced in 10 articles [sw14050]
  • QUARK (QUeuing And Runtime for Kernels) provides a library that enables the dynamic execution ... enable the efficient expression and implementation of complex algorithms. The driving application behind the development ... PLASMA linear algebra library, and the QUARK runtime contains several optimizations inspired by the algorithms...
  • Inc-cluster

  • Referenced in 4 articles [sw06866]
  • edge weight increments. Complexity analysis is provided to estimate how much runtime cost Inc-Cluster...
  • Rapsodia

  • Referenced in 12 articles [sw12522]
  • concerned with the complexity of computing higher-order derivative tensors even for a modest order ... operator overloading with unrolled loops showed better runtimes than using other automatic differentiation tools. Motivated...
  • PrimAlign

  • Referenced in 1 article [sw34148]
  • achieves superior performance in runtime with its linear asymptotic time complexity. Further evaluation is done...
  • FLENS

  • Referenced in 7 articles [sw04120]
  • development, maintainability, extensibility and usability of complex software packages. However, most libraries in the field ... mainly due to the fact that runtime overhead resulting from abstraction is sometimes hard...
  • d3p

  • Referenced in 1 article [sw37724]
  • evaluation of the runtime of the private inference on a complex model and find...
  • hess_pat

  • Referenced in 8 articles [sw11167]
  • function evaluation yielding the nonzero structure. A complexity analysis of the proposed algorithm is given ... provided implementing the presented algorithms. Runtime analyses are given for some problems of the CUTE...
  • Crowfoot

  • Referenced in 5 articles [sw07706]
  • code, runtime update of code and runtime code generation. Crowfoot’s assertion language, based ... stored on the heap. The tool addresses complex issues like deep frame rules and recursion...
  • jPlex

  • Referenced in 10 articles [sw09851]
  • computing persistent homology of finite simplicial complexes, often generated from point cloud data. This ... version 1.5 or later java runtime, either through Matlab or directly through a command line...
  • Superglue

  • Referenced in 2 articles [sw13511]
  • life application problems. However, with increased hardware complexity, the cost in man hours of writing ... while the performance is handled by a runtime system that schedules the tasks onto nodes ... control flow without artificial dependencies, has low complexity for resolving dependencies, and enables scheduling decisions ... performs well in comparison to similar runtime systems...