• OpenAD/F

  • Referenced in 24 articles [sw09380]
  • example, for basic block preaccumulation and call graph reversal. Unlike most other automatic differentiation tools ... through an XML schema. The implemented transformation algorithms allow efficient derivative computations using locally optimized ... level. As an example from geophysical fluid dynamics, a nonlinear time-dependent scalable, yet simple...
  • PMC

  • Referenced in 1 article [sw21471]
  • fast for large sparse graphs. Algorithms tested on networks of 1.8 billion edges ... accurate approximations. Algorithms for computing Temporal. Strongly Connected Components (TSCC) of large dynamic networks. Parameterized ... each algorithm can be selected at runtime. Dynamically reduces the graph representation periodically as vertices...
  • AmgX

  • Referenced in 14 articles [sw13440]
  • many applications, such as computational fluid dynamics and oil reservoir simulation. In realistic cases ... graph matching techniques, while the smoothers and preconditioners often rely on parallel graph coloring algorithms...
  • Laplacians.jl

  • Referenced in 2 articles [sw41227]
  • graph algorithms, with an emphasis on tasks related to spectral and algebraic graph theory ... graph Laplacians, low stretch spanning trees, sparsifiation, clustering, local clustering, and optimization on graphs ... graphs are represented by sparse adjacency matrices. This is both for speed, and because ... algebraic tasks. It does not handle dynamic graphs. It would be very slow to implement...
  • BiDAG

  • Referenced in 3 articles [sw31037]
  • provide the maximum a posteriori (MAP) graph or a sample (a collection of DAGs) from ... data. All algorithms are also applicable to structure learning of dynamic Bayesian networks. References...
  • HGV

  • Referenced in 2 articles [sw00406]
  • added and removed dynamically from the corresponding graph and hierarchy, respectively. The software library shall ... serve as a platform for algorithms and data structures on hierarchically structured graphs. Such graphs...
  • FactoredValueMCTS

  • Referenced in 1 article [sw42310]
  • computation for approximation quality and dynamically coordinate actions. Our algorithm comprises three elements: online planning ... representations of local agent interactions with coordination graphs, and the iterative Max-Plus method ... benchmark SysAdmin domain with static coordination graphs and achieve comparable performance with much lower computation ... multi-drone delivery domain with dynamic coordination graphs, and demonstrate how our approach scales...
  • EcoLab

  • Referenced in 6 articles [sw26811]
  • Support for more advanced data structures and algorithms are available through C++’s standard library ... variables, allowing experiments to be set up dynamically at runtime. The model ... widgets. Various graphs and histogramming tools are available for use. The same model...
  • DEXTER

  • Referenced in 1 article [sw24317]
  • graph of an extension or a restriction to that grammar. We implemented these algorithms ... dynamically updatable LALR parser generator called DEXTER (the Dynamically EXTEnsible Recognizer) that...
  • Gluon API

  • Referenced in 1 article [sw31174]
  • algorithm and model closer together to provide flexibility in the development process. Dynamic Graphs: Gluon...
  • ArcRoutingLibrary

  • Referenced in 2 articles [sw31825]
  • graph architecture with solvers for several uncapacitated arc routing problems and the ability to dynamically ... /Olibear/ArcRoutingLibrary (https://doi.org/10.5281/zenodo.2561406). We describe the algorithms in the library, report computational performance...
  • LPG

  • Referenced in 12 articles [sw20690]
  • current partial plan, and are dynamically evaluated during search using discrete Lagrange multipliers. The evaluation ... fuel consumption) are represented in the actions graphs, and are modeled in the evaluation function ... domains, actions are ordered using a ”precedence graph” that is maintained during search, and that ... account the mutex relations of the planning graph. The system can produce good quality plans...
  • RDyn

  • Referenced in 1 article [sw28444]
  • dynamics of network formation and evolution; as a direct consequence, synthesizing graphs having controlled topology ... assess the performances of community discovery algorithm. However, one relevant aspect of real-world networks ... ignored by benchmarks proposed so far: community dynamics. As time goes by network communities rise...
  • HashGraph

  • Referenced in 2 articles [sw35095]
  • tables that uses concepts taken from sparse graph representations--hence the name HashGraph. We show ... different variants of HashGraph, a simple algorithm that outlines the method to create the hash ... static inputs, though recent progress with dynamic graph data structures suggest that HashGraph might ... factor. Lastly, we show a new probing algorithm for the second phase of value lookups...
  • COStar

  • Referenced in 1 article [sw28651]
  • star Lite-based dynamic search algorithm for codon optimization. The algorithm first maps the codon ... optimization problem into a weighted directed acyclic graph using a sliding window approach. Then...
  • Snugglebug

  • Referenced in 7 articles [sw13707]
  • codes comprise large, partial programs with highly dynamic behaviors--polymorphism, reflection, and so on--posing ... First, we present directed call graph construction, where call graph construction and symbolic analysis ... interleaved. With this technique, call graph construction is guided by constraints discovered during symbolic analysis ... exhaustively exploring a large, conservative call graph. Second, we describe generalization, a technique that greatly...
  • jViz.Rna

  • Referenced in 4 articles [sw17135]
  • better understand the results of their algorithms and to enable life science researchers to interpret ... linked graph, circle graph, dot plot, and classical structure. Also, the output is dynamic...
  • EdgeRewire

  • Referenced in 7 articles [sw40656]
  • spreading rates of dynamic processes (e.g., rumor, disease, information propagation) on graphs. Algebraic connectivity ... edge connectivity of a graph, captures the “partitionability” of a graph into disjoint components ... address the problem of modifying a given graph’s structure under a given budget ... measure-independent heuristic approaches, we propose an algorithm, called extsc{EdgeRewire}, which optimizes a specific...
  • TreeJuxtaposer

  • Referenced in 6 articles [sw18623]
  • trees and provide a new nearly-linear algorithm for computing the best corresponding node from ... navigation that is well suited to the dynamic linking of side-by-side views while ... needed, ranging from network management to call graph optimization to genealogy...
  • SDSAT

  • Referenced in 2 articles [sw00842]
  • domain encoding approaches, but uses a novel algorithm Nu-SMOD with 1--2 orders ... model is never discarded. Moreover, we dynamically refine the allocated ranges and search ... also from the theory-specific graph-based algorithms (characteristic of lazy approaches). Experimental results show...