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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on parallel and distributed systems Jg. 8; H. 5; S. 490 - 501
Hauptverfasser:	Allen, R., Cinque, L., Tanimoto, S., Shapiro, L., Yasuda, D.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	IEEE 01.05.1997
Schlagworte:	Application software Artificial intelligence Computer vision Concurrent computing Image databases Load management Operations research Parallel algorithms Parallel processing Search problems
ISSN:	1045-9219
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!