Parallel state-space search for a first solution with consistent linear speedups
From MaRDI portal
Publication:757044
Recommendations
Cites work
- scientific article; zbMATH DE number 4162302 (Why is no real title available?)
- scientific article; zbMATH DE number 3821130 (Why is no real title available?)
- scientific article; zbMATH DE number 4090815 (Why is no real title available?)
- scientific article; zbMATH DE number 3657150 (Why is no real title available?)
- Anomalies in parallel branch-and-bound algorithms
- Backtrack programming techniques
- Concurrent access of priority queues
- Depth-first iterative-deepening: An optimal admissible tree search
- Parallel depth first search. I: Implementation
- Parallel depth first search. II: Analysis
- Symbolic integration
Cited in
(9)- PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE
- scientific article; zbMATH DE number 4090815 (Why is no real title available?)
- Parallel processing for difficult combinatorial optimization problems
- An almost perfect heuristic for the N nonattacking queens problem
- Best-first heuristic search for multicore machines
- Performances of parallel branch and bound algorithms with best-first search
- scientific article; zbMATH DE number 1555180 (Why is no real title available?)
- Building a parallel branch and bound library
- scientific article; zbMATH DE number 4058911 (Why is no real title available?)
This page was built for publication: Parallel state-space search for a first solution with consistent linear speedups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757044)