Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

72

Voted

AI
2011
Springer

favoriteEmaildiscussreport

171views Artificial Intelligence» more AI 2011»

Hybrid tractability of valued constraint problems

14 years 4 months ago

Hybrid tractability of valued constraint problems

Download zivny.cz

Martin C. Cooper, Stanislav Zivny

Real-time Traffic

AI 2011 | Artificial Intelligence |

claim paper

Related Content

» Hybrid tractability of soft constraint problems

» Hybrid tractable CSPs which generalize tree structure

» Tractable Cases of the Extended Global Cardinality Constraint

» Tractable Tree Convex Constraint Networks

» The Complexity of Valued Constraint Models

» A Maximal Tractable Class of Soft Constraints

» Tractable Symmetry Breaking Using Restricted Search Trees

» Hybrid Constraint Tightening for Solving Hybrid Scheduling Problems

» Tractable Optimal Competitive Scheduling

Post Info
More Details (n/a)

Added	12 May 2011
Updated	12 May 2011
Type	Journal
Year	2011
Where	AI
Authors	Martin C. Cooper, Stanislav Zivny

Comments (0)