Boost
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A new dichotomic algorithm for the uniform random generation of words in regular languages
- Kaskade 7 -- a flexible finite element toolbox
- Solving elementary shortest-path problems as mixed-integer programs
- Motion planning algorithms for the Dubins Travelling Salesperson Problem
- Non-replicability circumstances in a neural network model with Hodgkin-Huxley-type neurons
- Parallel fast isogeometric L2 projection solver with Galois system for 3D tumor growth simulations
- An isotropic unstructured mesh generation method based on a fluid relaxation analogy
- Modelling of a two-phase vortex-ring flow using an analytical solution for the carrier phase
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
- Fast and accurate algorithm for the generalized exponential integral \(E_{\nu}(x)\) for positive real order
- Lagrangian/Eulerian numerical methods for fluid interface advection on unstructured meshes
- A generic software design for Delaunay refinement meshing
- Extracting unsatisfiable cores for LTL via temporal resolution
- A language for generic programming in the large
- Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code
- A new constraint-based formulation for hydrodynamically resolved computational neuromechanics of swimming animals
- Multi-level adaptive particle refinement method with large refinement scale ratio and new free-surface detection algorithm for complex fluid-structure interaction problems
- Dynamics of locally coupled agents with next nearest neighbor interaction
- Hierarchical multiresolution approaches for dense point-level breast cancer treatment data
- Functional programming framework for \textit{GRworkbench}
- An adaptable and extensible geometry kernel
- Discontinuous Galerkin method on three-dimensional tetrahedral grids. The use of template metaprogramming of the C++ language
- A flow based pruning scheme for enumerative equitable coloring algorithms
- The mimetic methods toolkit: an object-oriented API for mimetic finite differences
- A new open-source software developed for numerical simulations using discrete modeling methods
- Enhancing unsatisfiable cores for LTL with information on temporal relevance
- The \texttt{deal.II} library, version 9.4
- Formalising and implementing Boost POSIX regular expression matching
- Sequential Bayesian model selection of regular vine copulas
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
- The secret life of keys: on the calculation of mechanical lock systems
- Treewidth computations. II. Lower bounds
- A worker constrained flexible job shop scheduling problem with sequence-dependent setup times
- An Evaluation of Automata Algorithms for String Analysis
- Using graph theory for automated electric circuit solving
- A software package for chemically inspired graph transformation
- Sparse group Lasso and high dimensional multinomial classification
- ViennaCL-linear algebra library for multi- and many-core architectures
- Tree search algorithm for assigning cooperating UAVs to multiple tasks
- IGA-ADS: isogeometric analysis FEM using ADS solver
- Multiresolution coupled vertical equilibrium model for fast flexible simulation of CO\(_2\) storage
- To CG or to HDG: A comparative study
- Models for the single-vehicle preemptive pickup and delivery problem
- Model-based quantification of left ventricular diastolic function in critically ill patients with atrial fibrillation from routine data: a feasibility study
- Minimum-cost flow algorithms: an experimental evaluation
- A parallel bio-inspired shortest path algorithm
- Bounds on maximum concurrent flow in random bipartite graphs
- Computing large matchings in planar graphs with fixed minimum degree
- Multifractal analysis and topological properties of a new family of weighted Koch networks
- Algorithm 910: A portable C++ multiple-precision system for special-function calculations
- Formalising Boost POSIX regular expression matching
- The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP
- A generic exact solver for vehicle routing and related problems
- Analytical and simulation-based design space exploration of software defined radios
- Numerical object oriented quantum field theory calculations
- The stability of barycentric interpolation at the Chebyshev points of the second kind
- Verification of the Jones unknot conjecture up to 22 crossings
- Efficient and accurate parallel inversion of the gamma distribution
- Concepts for High-Perfomance Scientific Computing
- Selection of vine copulas
- A portable parallel implementation of the \textit{lrs} vertex enumeration code
- Evaluating an element of the Clarke generalized Jacobian of a composite piecewise differentiable function
- Properties of the DGS-auction algorithm
- Emergence of giant strongly connected components in continuum disk-spin percolation
- Single liner shipping service design
- \texttt{Tusas}: a fully implicit parallel approach for coupled phase-field equations
- \textsc{OpenCL} based parallel algorithm for RBF-PUM interpolation
- Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms
- Computing the Lambert \(W\) function in arbitrary-precision complex interval arithmetic
- On the effectiveness of the genetic paradigm for polygonization
- On estimation of the diagonal elements of a sparse precision matrix
- Productivity, performance, and portability for computational fluid dynamics applications
- Fracture and fragmentation of simplicial finite element meshes using graphs
- Practical Guide to Computer Simulations
- An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures
- A Distributed Interior-Point KKT Solver for Multistage Stochastic Optimization
- Using a template engine as a computer algebra tool
- Certifying feasibility and objective value of linear programs
- Interval Arithmetic Using SSE-2
- Hierarchical multigrid approaches for the finite cell method on uniform and multi-level \(h p\)-refined grids
- Heuristics for the mixed swapping problem
- Coin-flipping, Ball-dropping, and Grass-hopping for generating random graphs from matrices of edge probabilities
- Design and evaluation of C++ open multi-methods
- Programming with C++ concepts
- On the impact of the migration topology on the island model
- A new formulation for the safe set problem on graphs
- The supporting hyperplane optimization toolkit for convex MINLP
- How do you compute the midpoint of an interval?
- Parallelization of the multi-level \(hp\)-adaptive finite cell method
- Exact algorithms for budgeted prize-collecting covering subgraph problems
- A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
- Exact approaches for network design problems with relays
- Solving path problems on the GPU
- Dynamic Matching Algorithms in Practice
- On the performance of exponential integrators for problems in magnetohydrodynamics
- Fractionation in planar kinematic chains: reconciling enumeration contradictions
- ALTDSE
- AUTOMATE
- Blitz++
- CGAL
This page was built for software: Boost
