Parallel branch-and-branch algorithms: Survey and synthesis
B Gendron, TG Crainic - Operations research, 1994 - pubsonline.informs.org
We present a detailed and up-to-date survey of the literature on parallel branch-and-bound
algorithms. We synthesize previous work in this area and propose a new classification of …
algorithms. We synthesize previous work in this area and propose a new classification of …
[图书][B] Parallel computation: models and methods
SG Akl - 1997 - dl.acm.org
Parallel computation | Guide books skip to main content ACM Digital Library home ACM home
Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced Search …
Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced Search …
[图书][B] Designing efficient algorithms for parallel computers
MJ Quinn - 1987 - dl.acm.org
Designing efficient algorithms for parallel computers | Guide books skip to main content ACM
Digital Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign …
Digital Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign …
Concurrent access of priority queues
RV Nageshwara, V Kumar - IEEE Transactions on Computers, 1988 - ieeexplore.ieee.org
Contention for the shared heap limits the obtainable speedup in parallel algorithms using
this data structure as a priority queue. An approach that allows concurrent insertions and …
this data structure as a priority queue. An approach that allows concurrent insertions and …
[PDF][PDF] Parallel Best-First Search of State-Space Graphs: A Summary of Results.
This paper presents many di erent parallel formulations of the A*/Branch-and-Bound search
algorithm. The parallel formulations primarily di er in the data structures used. Some …
algorithm. The parallel formulations primarily di er in the data structures used. Some …
[图书][B] Conflicting agents: conflict management in multi-agent systems
C Tessier, L Chaudron, HJ Müller - 2005 - books.google.com
Conflicts between agents acting in a multi-agent environment arise for different reasons,
involve different concepts, and are dealt with in different ways, depending on the kind of …
involve different concepts, and are dealt with in different ways, depending on the kind of …
Parallel search algorithms for discrete optimization problems
A Grama, V Kumar - ORSA Journal on Computing, 1995 - pubsonline.informs.org
Discrete optimization problems (DOPs) arise in various applications such as planning,
scheduling, computer aided design, robotics, game playing and constraint directed …
scheduling, computer aided design, robotics, game playing and constraint directed …
[PS][PS] Designing and building parallel programs
WP Computing, I Foster - 1995 - mcs.anl.gov
◆ Climate model–1016 ops for 10 yr simulation (10 days@ 10GF)–Easily generate 100 GB
data–Want x 104: more resolution, duration, detail◆ 3-D real-time video–Data sets …
data–Want x 104: more resolution, duration, detail◆ 3-D real-time video–Data sets …
[图书][B] Models for iterative global optimization
KD Boese - 1996 - search.proquest.com
Large instances of intractable optimizations such as graph partitioning or the traveling
salesman problem arise in many areas of science and engineering. Heuristic solutions to …
salesman problem arise in many areas of science and engineering. Heuristic solutions to …
Superlinear speedup in parallel state-space search
VN Rao, V Kumar - Foundations of Software Technology and Theoretical …, 1988 - Springer
When N processors perform depth-first search on disjoint parts of a state space tree to find a
solution, the speedup can be superlinear (ie,> N) or sublinear (ie,< N) depending upon …
solution, the speedup can be superlinear (ie,> N) or sublinear (ie,< N) depending upon …