Sciweavers

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

8

AI
2007
Springer

favoriteEmaildiscussreport

109views Artificial Intelligence» more AI 2007»

Random constraint satisfaction: Easy generation of hard (satisfiable) instances

13 years 4 months ago

Random constraint satisfaction: Easy generation of hard (satisfiable) instances

Download www.nlsde.buaa.edu.cn

Ke Xu, Frédéric Boussemart, Fred Hem

Real-time Traffic

AI 2007 | Artificial Intelligence |

claim paper

Related Content

» Hidden Gold in Random Generation of SAT Satisfiable Instances

» Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Paramete...

» A Random Constraint Satisfaction Problem That Seems Hard for DPLL

» Generating Satisfiable Problem Instances

» Balance and Filtering in Structured Satisfiable Problems

» Unbiased Statistics of a Constraint Satisfaction Problem a ControlledBias Generator

» HeavyTailed Phenomena in Satisfiability and Constraint Satisfaction Problems

» The Impact of Balancing on Problem Hardness in a Highly Structured Domain

» In Search of the Best Constraint Satisfaction Search

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2007
Where	AI
Authors	Ke Xu, Frédéric Boussemart, Fred Hemery, Christophe Lecoutre

Comments (0)