Parallel Computer Architectures and Problem Solving Strategies for the Consistent Labeling Problem

Authors:
Jeanette T. McCall;Joseph G. Tront;F. G. Gray;Robert M. Haralick;William M. McCormack
Affiliations:
IBM Corp., Mannassas, VA;Virginia Polytechnic Institute and State Univ., Blacksburg, VA;Virginia Polytechnic Institute and State Univ., Blacksburg, VA;Machine Vision International, Ann Arbor, MI;Virginia Polytechnic Institute and State Univ., Blacksburg, VA
Venue:
IEEE Transactions on Computers
Year:
1985

Citing 0
Cited 5

A Multilevel Parallel Processing Approach to Scene Labeling Problems

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Novel Discrete Relaxation Architecture

IEEE Transactions on Pattern Analysis and Machine Intelligence
Convergence Properties of Optimization Algorithms for the SAT Problem

IEEE Transactions on Computers
A Template-Based Approach to the Generation of Distributed Applications Using a Network of Workstations

IEEE Transactions on Parallel and Distributed Systems
Partition search for non-binary constraint satisfaction

Information Sciences: an International Journal

Quantified Score

Hi-index	14.98

Visualization

Abstract

Parallel computer architectures and problem solving strategies for the consistent labeling problem are studied. Problem solving factors include: processor intercommunication methods, passing order, and selection of the initial processor to receive the problem.