Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs
From MaRDI portal
Publication:1706596
DOI10.1007/s10601-017-9274-1zbMath1395.90187arXiv1608.05288OpenAlexW3105349602MaRDI QIDQ1706596
Enrico Pontelli, Ferdinando Fioretto, Rina Dechter, William Yeoh
Publication date: 22 March 2018
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.05288
Related Items
Efficiently approximating high-dimensional Pareto frontiers for tree-structured networks using expansion and compression ⋮ Unnamed Item ⋮ Differential privacy of hierarchical Census data: an optimization approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Memory intensive AND/OR search for combinatorial optimization in graphical models
- Network-based heuristics for constraint-satisfaction problems
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Solving knapsack problems on GPU
- Networks of constraints: Fundamental properties and applications to picture processing
- A dynamic programming approach for consistency and propagation for knapsack constraints
- Bucket elimination: A unifying framework for reasoning
- Computational protein design as an optimization problem
- Adopt: asynchronous distributed constraint optimization with quality guarantees
- The state of the art of nurse rostering
- Emergence of Scaling in Random Networks
- Mini-buckets
- Approximations in Distributed Optimization
- Global Grammar Constraints
- Principles of Constraint Programming
- BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm
- Semiring-based constraint satisfaction and optimization
- Constrained Community-Based Gene Regulatory Network Inference
- Autonomous agents coordination: Action languages meet CLP() and Linda
- AND/OR Branch-and-Bound on a Computational Grid
- Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms
- KI 2004: Advances in Artificial Intelligence
- Principles and Practice of Constraint Programming – CP 2004
- Algorithm for optimal winner determination in combinatorial auctions
