Back to Results
First PageMeta Content
Computer programming / Local consistency / Constraint satisfaction / Constraint logic programming / Parameterized complexity / Mathematical optimization / Clique problem / Decomposition method / Complexity of constraint satisfaction / Constraint programming / Theoretical computer science / Software engineering


The Parameterized Complexity of Global Constraints∗ C. Bessiere LIRMM Montpellier, France
Add to Reading List

Document Date: 2010-11-22 06:22:28


Open Document

File Size: 198,92 KB

Share Result on Facebook

Company

European Journal / ILOG Inc. / S. / Puget / /

Country

France / /

/

Facility

University of Waterloo / /

IndustryTerm

polynomial algorithm / constraint networks / backtrack-free search / domain consistency algorithm / symmetric solutions / constraint propagation algorithms / car-sequencing / propagation algorithms / complexity tools / search space / car sequencing / approximation algorithms / search problems / search methods / /

OperatingSystem

XP / /

Organization

Australian Government’s Department of Broadband / Communications and the Digital Economy / Scientific and Technological Research Council of Turkey / Ecole Polytechnique / Artificial Copyright Intelligence / Association for the Advancement / University of Waterloo / EG CC / Australian Research Council / /

Person

Gomes / Toby Walsh / /

Position

vp / reading vp / /

ProgrammingLanguage

R / /

PublishedMedium

Journal of the ACM / /

Technology

domain consistency algorithm / filtering algorithm / Broadband / propagation algorithms / GAC algorithm / artificial intelligence / GAC-Schema algorithm / Filtering algorithms / constraint propagation algorithms / approximation algorithms / radio frequency / dom / polynomial algorithm / /

URL

www.aaai.org / /

SocialTag