Back to Results
First PageMeta Content
Computing / Local consistency / Constraint satisfaction problem / Constraint satisfaction / Maximum flow problem / Constraint inference / Constraint programming / Software engineering / Computer programming


Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraintsāˆ— Christian Bessiere LIRMM, CNRS and U. Montpellier
Add to Reading List

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

Open Document

File Size: 394,24 KB

Share Result on Facebook

Country

France / Australia / /

/

Facility

Building GC / Brahim Hnich Izmir University of Economics Izmir / /

IndustryTerm

specialised propagation algorithms / polynomial algorithm / unit capacity networks / correct algorithm / purpose propagation algorithms / search tree / still solution / specialised propagation algorithm / propagation algorithms / capacity network / search space / flow algorithm / propagation algorithm / unit capacity network / /

Organization

Computer Science Univ. / University of Economics Izmir / /

Person

Toby Walsh / Emmanuel Hebrard / /

Position

first author / /

ProvinceOrState

British Columbia / /

Technology

correct algorithm / propagation algorithms / flow algorithm / propagation algorithm / specialised propagation algorithms / 8 Algorithm / 2 The algorithm / purpose propagation algorithms / specialised propagation algorithm / polynomial algorithm / /

SocialTag