Probabilistic Relaxation as an Optimizer. | Zendy

A.J. Stoddart | Zendy; M. Petrou | Zendy; Josef Kittler | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Probabilistic Relaxation as an Optimizer.

Author(s) -

A.J. Stoddart,

M. Petrou,

Josef Kittler

Publication year - 1995

Publication title -

citeseer x (the pennsylvania state university)

Language(s) - English

Resource type - Conference proceedings

DOI - 10.5244/c.9.61

Subject(s) - probabilistic logic , relaxation (psychology) , computer science , product (mathematics) , function (biology) , probabilistic analysis of algorithms , class (philosophy) , probabilistic ctl , mathematical optimization , algorithm , mathematics , artificial intelligence , psychology , social psychology , geometry , evolutionary biology , biology

Probabilistic Relaxation with product support has been shown to have advantages over 'traditional' probabilistic relaxation. However it is less well understood in the sense that a cost function is not known. In this paper we present a cost function. This greatly improves our understanding of probabilistic relaxation with product support, and also leads us to propose a new class of probabilistic relaxation algorithms. We investigate two applications.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research