z-logo
open-access-imgOpen Access
Exploiting tree decomposition and soft local consistency in weighted CSP
Author(s) -
Simon de Givry,
Thomas Schiex,
Gérard Verfaillie
Publication year - 2006
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - local consistency , computer science , heuristics , theoretical computer science , consistency (knowledge bases) , decomposition method (queueing theory) , decomposition , exploit , pruning , tree decomposition , constraint (computer aided design) , bayesian network , tree (set theory) , mathematical optimization , algorithm , constraint satisfaction , graph , mathematics , artificial intelligence , probabilistic logic , discrete mathematics , ecology , mathematical analysis , geometry , computer security , pathwidth , line graph , agronomy , biology

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

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom