Boost

swMATH9223MaRDI QIDQ21213FDOQ21213

Author name not available (Why is that?)

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

• 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
• A generic software design for Delaunay refinement meshing
• 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
• A High-Order Method for Weakly Compressible Flows
• 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
• COMPAS - A Computing Package for Synchronization
• The stability of barycentric interpolation at the Chebyshev points of the second kind
• GUIDE: Parallel library-centric application design by a generic scientific simulation environment
• 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
• SIMPLE AND EFFECTIVE C++ MATRIX–VECTOR LIBRARY FOR NONPROFESSIONALS IN COMPUTER SCIENCE
• 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
• Scheduling arc maintenance jobs in a network to maximize total flow over time
• JGraphT—A Java Library for Graph Data Structures and Algorithms
• A computable criterion for the existence of connecting orbits in autonomous dynamics
• Krylov subspace methods for the Dirac equation
• \textsc{BAL}: a library for the \textit{brute-force} analysis of dynamical systems
• A Generic Framework for Engineering Graph Canonization Algorithms
• Direct Function Evaluation versus Lookup Tables: When to Use Which?
• Algorithm 947
• Unified form language
• Title not available (Why is that?)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• A new heuristic for detecting non-Hamiltonicity in cubic graphs
• Computational Science – ICCS 2005
• Title not available (Why is that?)
• Some perspectives on statistical computing
• The design of the Boost interval arithmetic library
• ViennaMaterials -- a dedicated material library for computational science and engineering
• Training effective node classifiers for cascade classification
• Evacuation dynamics influenced by spreading hazardous material
• A locking-free meshfree method for the simulation of shear-deformable plates based on a mixed variational formulation
• Necessary and sufficient condition for the global stability of a delayed discrete-time single neuron model
• Nektar++: an open-source spectral/\(hp\) element framework
• Capacity inverse minimum cost flow problem
• Complex-shaped beam element and graph-based optimization of compliant mechanisms
• Computing of B-series by automatic differentiation
• Local stability implies global stability for the 2-dimensional Ricker map
• A resistive magnetohydrodynamics solver using modern C++ and the Boost library
• Parallel implementation of a Lagrangian-based model on an adaptive mesh in C++: application to sea-ice
• 2CoBel: a scalable belief function representation for 2D discernment frames
• Continuous-time hybridization expansion quantum impurity solver for multi-orbital systems with complex hybridizations
• Enumeration of 2-level polytopes
• Implementation of a unimodularity test
• Optimizations in computing the Duquenne-Guigues basis of implications
• A note on the separation of subtour elimination constraints in elementary shortest path problems
• Branch-and-price for staff rostering: an efficient implementation using generic programming and nested column generation
• 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
• High Performance Rearrangement and Multiplication Routines for Sparse Tensor Arithmetic
• 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
• Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code
• Exact Approaches for Network Design Problems with Relays
• 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
• 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
• Motion planning via manifold samples
• \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

This page was built for software: Boost