Boost

swMATH9223MaRDI QIDQ21213FDOQ21213

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Motion planning algorithms for the Dubins Travelling Salesperson Problem
• Fast and accurate algorithm for the generalized exponential integral \(E_{\nu}(x)\) for positive real order
• A new constraint-based formulation for hydrodynamically resolved computational neuromechanics of swimming animals
• A language for generic programming in the large
• Hierarchical multiresolution approaches for dense point-level breast cancer treatment data
• An adaptable and extensible geometry kernel
• A flow based pruning scheme for enumerative equitable coloring algorithms
• Tree search algorithm for assigning cooperating UAVs to multiple tasks
• A worker constrained flexible job shop scheduling problem with sequence-dependent setup times
• IGA-ADS: isogeometric analysis FEM using ADS solver
• Multiresolution coupled vertical equilibrium model for fast flexible simulation of CO\(_2\) storage
• A parallel bio-inspired shortest path algorithm
• Computing large matchings in planar graphs with fixed minimum degree
• Multifractal analysis and topological properties of a new family of weighted Koch networks
• Formalising Boost POSIX regular expression matching
• 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
• Concepts for High-Perfomance Scientific Computing
• Selection of vine copulas
• A portable parallel implementation of the \textit{lrs} vertex enumeration code
• \textsc{OpenCL} based parallel algorithm for RBF-PUM interpolation
• Computing the Lambert \(W\) function in arbitrary-precision complex interval arithmetic
• On the effectiveness of the genetic paradigm for polygonization
• Fracture and fragmentation of simplicial finite element meshes using graphs
• Practical Guide to Computer Simulations
• Hierarchical multigrid approaches for the finite cell method on uniform and multi-level \(h p\)-refined grids
• A new formulation for the safe set problem on graphs
• Design and evaluation of C++ open multi-methods
• Programming with C++ concepts
• On the impact of the migration topology on the island model
• Exact approaches for network design problems with relays
• A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
• On the performance of exponential integrators for problems in magnetohydrodynamics
• High performance rearrangement and multiplication routines for sparse tensor arithmetic
• Fractionation in planar kinematic chains: reconciling enumeration contradictions
• Determination of multifractal dimensions of complex networks by means of the sandbox algorithm
• Unsymmetric multi-level hanging nodes and anisotropic polynomial degrees in \(H^1\)-conforming higher-order finite element methods
• Dynamic algorithm selection for runtime concepts
• The simplified partial digest problem: approximation and a graph-theoretic model
• GEMSFIT: a generic fitting tool for geochemical activity models
• Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks
• A generic topology library
• Graph approach to quantum systems
• Adaptive spectral solution method for the Landau and Lenard-Balescu equations
• Hybridization of mixed high-order methods on general meshes and application to the Stokes equations
• A survey on design and implementation of protected searchable data in the cloud
• A new multi-resolution parallel framework for SPH
• On design and implementation of a generic number type for real algebraic number computations based on expression dags
• France Telecom workforce scheduling problem: a challenge
• A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
• A new directional algebraic fast multipole method based iterative solver for the Lippmann-Schwinger equation accelerated with HODLR preconditioner
• Edge stability in secure graph domination
• Efficient Verified Implementation of Introsort and Pdqsort
• An improved multiobjective shortest path algorithm
• Optimal distributed linear averaging
• Fast method of approximate particular solutions using Chebyshev interpolation
• HyPAM: A hybrid continuum-particle model for incompressible free-surface flows
• Advanced programming techniques applied to CGAL's arrangement package
• Error-correcting neural networks for two-dimensional curvature computation in the level-set method
• Machine learning algorithms for three-dimensional mean-curvature computation in the level-set method
• Morphing of triangular meshes in shape space
• A new dichotomic algorithm for the uniform random generation of words in regular languages
• Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
• Lagrangian/Eulerian numerical methods for fluid interface advection on unstructured meshes
• A generic software design for Delaunay refinement meshing
• Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code
• Extracting unsatisfiable cores for LTL via temporal resolution
• 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
• The \texttt{deal.II} library, version 9.4
• Mixed-integer programming techniques for the connected max-\(k\)-cut problem
• Enhancing unsatisfiable cores for LTL with information on temporal relevance
• An Evaluation of Automata Algorithms for String Analysis
• Sequential Bayesian model selection of regular vine copulas
• ViennaCL-linear algebra library for multi- and many-core architectures
• Sparse group Lasso and high dimensional multinomial classification
• Treewidth computations. II. Lower bounds
• Minimum-cost flow algorithms: an experimental evaluation
• To CG or to HDG: A comparative study
• Models for the single-vehicle preemptive pickup and delivery problem
• The stability of barycentric interpolation at the Chebyshev points of the second kind
• Evaluating an element of the Clarke generalized Jacobian of a composite piecewise differentiable function
• Properties of the DGS-auction algorithm
• Single liner shipping service design
• Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms
• On estimation of the diagonal elements of a sparse precision matrix
• Interval Arithmetic Using SSE-2
• Certifying feasibility and objective value of linear programs
• Heuristics for the mixed swapping problem
• How do you compute the midpoint of an interval?
• The supporting hyperplane optimization toolkit for convex MINLP
• Solving path problems on the GPU
• Network design for time‐constrained delivery
• A high-order method for weakly compressible flows
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• An output-sensitive algorithm for computing projections of resultant polytopes
• A reformulation framework for global optimization
• Treewidth computations. I: Upper bounds
• A framework for globally optimizing mixed-integer signomial programs

This page was built for software: Boost