A parallel algorithm for graph matching and its MasPar implementation

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 heuri...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on parallel and distributed systems Vol. 8; no. 5; pp. 490 - 501
Main Authors:	Allen, R., Cinque, L., Tanimoto, S., Shapiro, L., Yasuda, D.
Format:	Journal Article
Language:	English
Published:	IEEE 01.05.1997
Subjects:	Application software Artificial intelligence Computer vision Concurrent computing Image databases Load management Operations research Parallel algorithms Parallel processing Search problems
ISSN:	1045-9219
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!