Sciweavers

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

8

FLAIRS
2003

favoriteEmaildiscussreport

75views Artificial Intelligence» more FLAIRS 2003»

Language, Definition and Optimal Computation of CSP Approximations

13 years 6 months ago

Language, Definition and Optimal Computation of CSP Approximations

Download www.aaai.org

Arnaud Lallouet, Thi-Bich-Hanh Dao, AbdelAli Ed-Db

Real-time Traffic

Artificial Intelligence | FLAIRS 2003 |

claim paper

Related Content

» Ruling Out PolynomialTime Approximation Schemes for Hard Constraint Satisfaction Problems

» The Complexity of Approximating BoundedDegree Boolean CSP

» Universal Algebra and Hardness Results for Constraint Satisfaction Problems

» Hard constraint satisfaction problems have hard gaps at location 1

» New Search Heuristics for MaxCSP

» Krylov Subspace Descent for Deep Learning

» On the Computation of Local Interchangeability in Soft Constraint Satisfaction Problems

» Definitional Trees

» RateBased Transition Systems for Stochastic Process Calculi

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2003
Where	FLAIRS
Authors	Arnaud Lallouet, Thi-Bich-Hanh Dao, AbdelAli Ed-Dbali

Comments (0)