Systems with Statistically Coupled Processors
Many practical problems can be represented by schemes like that in Fig.l. The nodes represent the fact that some local problems have to be solved consistently with the constraints which are represented by the links. The scheme as a whole represents one global problem. The scheme just corresponds to the fact that this global problem has to do with data having rich structure.
KeywordsTravelling Salesman Problem Global Problem Simulated Annealing Method Pattern Recognition Problem Consistency Requirement
Unable to display preview. Download preview PDF.
- 1.V.Černý: Multiprocessor System as a Statistical Ensemble, a Way Towards General Purpose Parallel Processing and MIMD Computers,preprint, Comenius Univ. Bratislava, 1983Google Scholar
- 2.S.girkpatrick, C.D.Gelat,M.P.Vecchi, Science 220, 671 1983Google Scholar
- 3.V.Cerny, A Thermodynamical Approach to the Travelling Salesman Problem, preprint, Comenius Univ. Bratislava, 1982 and J.of OptimoTheoxy and Appi. 45, 41 1985Google Scholar
- 4.L.T.Wille, Optimization by Simulated Annealing, an Overview and Some Case Studies, In Inf. Quarterly for Comp. Slmul. of Condensed Physes, Daresbury Lab., No. 20, 1986Google Scholar
- 5.E.H.L.Aarts, P.J.M. van Laarhoven: Simulated Annealing, Theory and Applications, to be publishedGoogle Scholar
- 6.N.Metropolis et al.: J.Chem.Phys. 21, 1067 1953Google Scholar
- 7.V.Černý: preprint Helsinki Univ. HtPTFT-84-51, 1984Google Scholar
- 8.V.Černý: Annealing Algorithm and Parallel Processing, an Option to Approach Pattern Recognition Problems, preprint, Comenius Univ. Bratislava, 1984Google Scholar
- 9.V.Černý: Picture Processing by Statistically Coupled Processors, Relaxation Syntactical Analysis, IBM Europe Summer School, Oberlech July 1986 and preprint, Comenius Univ. Bratislava, 1986Google Scholar
- 10.G.F.Hinton et al.: preprint Carnegie-Mellon Univ. CMU-CS-84-119 1984Google Scholar