Exact MAP-Inference by Confining Combinatorial Search With LP Relaxation | Zendy

Stefan Haller | Zendy; Paul Swoboda | Zendy; Bogdan Savchynskyy | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Exact MAP-Inference by Confining Combinatorial Search With LP Relaxation

Author(s) -

Stefan Haller,

Paul Swoboda,

Bogdan Savchynskyy

Publication year - 2018

Publication title -

proceedings of the aaai conference on artificial intelligence

Language(s) - English

Resource type - Journals

eISSN - 2374-3468

pISSN - 2159-5399

DOI - 10.1609/aaai.v32i1.12202

Subject(s) - constraint satisfaction problem , relaxation (psychology) , solver , inference , hierarchy , property (philosophy) , constraint (computer aided design) , combinatorial optimization , fraction (chemistry) , linear programming relaxation , mathematics , computer science , combinatorics , combinatorial explosion , combinatorial search , mathematical optimization , linear programming , search algorithm , probabilistic logic , artificial intelligence , psychology , social psychology , philosophy , chemistry , geometry , beam search , organic chemistry , epistemology , economics , market economy

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