• SIMBICON

  • Referenced in 7 articles [sw21525]
  • styles in real-time, including walking in all directions (forwards, backwards, sideways, turning), running, skipping...
  • POLYMER

  • Referenced in 2 articles [sw12649]
  • dimensional directed lattice walks with boundaries. We pesent general algorithms (fully implemented in Maple ... various quantities related to constrained directed walks for a general set of steps...
  • triangulation

  • Referenced in 3 articles [sw10357]
  • resultant vertices in a given direction, thus avoiding walking on the polytope whose dimension...
  • QSWalk.m

  • Referenced in 1 article [sw27610]
  • time evaluation of Quantum Stochastic Walks (QSWs) on arbitrary directed and weighted graphs. QSWs ... incoherent component allows for quantum walks along directed graph edges. The dynamics of QSWs...
  • FODE

  • Referenced in 69 articles [sw08377]
  • scenarios such as continuous time random walk models, generalized Langevin equations, or the generalized master ... alpha =1.0$ with the ones of directly discretizing classical Fokker-Planck equation, some numerical results...
  • QSWalk

  • Referenced in 2 articles [sw27606]
  • procedures developed using stochastic quantum walks on arbitrary directed graphs. We provide a detailed description...
  • ramcmc

  • Referenced in 12 articles [sw17890]
  • adapting the shape of the random walk Metropolis proposal as specified by robust adaptive Metropolis ... downdate. These functions can be used directly from R or the corresponding C++ header files...
  • qwViz

  • Referenced in 2 articles [sw27609]
  • visualisation of the time-evolution of quantum walks on arbitrarily complex graphs. The package ... used to directly simulate discrete-time quantum walks on undirected graphs when provided with...
  • Grapham

  • Referenced in 5 articles [sw08541]
  • Grapham: graphical models with adaptive random walk Metropolis algorithms. Recently developed adaptive Markov chain Monte ... methods, with emphasis on graphical models for directed acyclic graphs. The implemented algorithms include...
  • JLink

  • Referenced in 2 articles [sw06794]
  • Java objects, call methods, and access fields directly from the Mathematica language. Thus ... dialog box or sophisticated wizard that walks users through a calculation. Such an interface...
  • RadFil

  • Referenced in 1 article [sw26491]
  • length. Pre-existing spines can be inputted directly into RadFil, or can be computed using ... building and fitting process. We walk through the typical RadFil workflow and compare our results...
  • ADOL-C

  • Referenced in 206 articles [sw00019]
  • ADOL-C: Automatic Differentiation of C/C++. We present...
  • AXIOM

  • Referenced in 161 articles [sw00063]
  • Axiom is a general purpose Computer Algebra system...
  • CGAL

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

  • Referenced in 145 articles [sw00258]
  • Expokit provides a set of routines aimed at...
  • GAP

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

  • Referenced in 117 articles [sw00344]
  • The gfun package provides tools for determining and...
  • LANCELOT

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

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

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