MONITORING RELAXATION ALGORITHMS USING LABELING EVALUATIONS.

Shmuel Peleg*

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

6 Scopus citations

Abstract

Relaxation algorithms employ an initial stochastic classification and a probabilistic model for deferring final decision. In such algorithms it is desirable to evaluate a classification based on an initial stochastic classification and a probabilistic model. Such evaluation can monitor the classification and ensure reasonable results. Specific classifications are evaluated, rather than evaluating the intermediate probabilistic classifications as was considered in previous work. Since relaxation algorithms are not guaranteed to converge to a reasonable solution, monitoring them is useful as a stopping criterion.

Original languageEnglish
Pages54-57
Number of pages4
StatePublished - 1980
EventUnknown conference - Miami Beach, FL, USA
Duration: 1 Dec 19804 Dec 1980

Conference

ConferenceUnknown conference
CityMiami Beach, FL, USA
Period1/12/804/12/80

Fingerprint

Dive into the research topics of 'MONITORING RELAXATION ALGORITHMS USING LABELING EVALUATIONS.'. Together they form a unique fingerprint.

Cite this