Parallel state-space search for a first solution with consistent linear speedups
From MaRDI portal
Publication:757044
DOI10.1007/BF01379360zbMATH Open0723.68043OpenAlexW2048871993MaRDI QIDQ757044FDOQ757044
Authors: Vikram A. Saletore, Laxmikant V. Kalé 
Publication date: 1990
Published in: International Journal of Parallel Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01379360
Recommendations
Cites Work
- Title not available (Why is that?)
- Depth-first iterative-deepening: An optimal admissible tree search
- Backtrack programming techniques
- Title not available (Why is that?)
- Concurrent access of priority queues
- Parallel depth first search. II: Analysis
- Symbolic integration
- Parallel depth first search. I: Implementation
- Title not available (Why is that?)
- Anomalies in parallel branch-and-bound algorithms
- Title not available (Why is that?)
Cited In (9)
- Best-first heuristic search for multicore machines
- Building a parallel branch and bound library
- Performances of parallel branch and bound algorithms with best-first search
- Title not available (Why is that?)
- Title not available (Why is that?)
- PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE
- Title not available (Why is that?)
- An almost perfect heuristic for the N nonattacking queens problem
- Parallel processing for difficult combinatorial optimization problems
Uses Software
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)
