.png){kind=icon}
返回
A parallel algorithm for graph matching and its MasPar implementation
.png){kind=icon}
PRE
AI
DOI：10.1109/71.598276.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Search of discrete spaces is important in combinatorial optimization. Such problems arise in artificial intelligence, computer vision, operations research, and other areas. For realistic problems, the search spaces to be processed are usually huge, necessitating long computation times, pruning heuristics, or massively parallel processing. We present an algorithm that reduces the computation time for graph matching by employing both branch-and-bound pruning of the search tree and massively-parallel search of the as-yet-unpruned portions of the space. Most research on parallel search has assumed that a multiple-instruction-stream/multiple-data-stream (MIMD) parallel computer is available. Since massively parallel single-instruction-stream/multiple-data-stream (SIMD) computers are much less expensive than MIMD systems with equal numbers of processors, the question arises as to whether SIMD systems can efficiently handle state-space search problems. We demonstrate that the answer is yes, and in particular, that graph matching has a natural acid efficient implementation on SIMD machines.
Keyword:
graph
matching
parallel algorithm
SIMD
branch-and-bound
search
MasPar
combinatorial explosion
forward checking
load balancing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Possible risk factors in the development of eating disorders in overweight pre-adolescent girls
PREAI
分享收藏分享收藏Changes in rectal and mean skin temperature in response to suggested heat during hypnosis in man☆
PREAI
分享收藏
查看更多内容