Back to Results
First PageMeta Content
Constraint satisfaction problem / Computing / Constraint satisfaction / Constraint logic programming / Complexity of constraint satisfaction / Constraint programming / Software engineering / Computer programming


Random Constraint Satisfaction: Easy Generation of Hard (Satisfiable) Instances Ke Xu 1,∗ National Lab of Software Development Environment, School of Computers,
Add to Reading List

Document Date: 2007-04-10 23:13:08

Open Document

File Size: 352,75 KB

Share Result on Facebook

Company

Random Constraint Networks / /

/

Facility

Beihang University / /

IndustryTerm

constraint networks / random binary constraint networks / incomplete algorithms / given constraint network / constraint network / random networks / incomplete search methods / /

Organization

School of Computers / Beihang University / Beijing / Computer Science and Artificial Intelligence / Instances Ke Xu 1 / ∗ National Lab of Software Development Environment / /

Person

Christophe Lecoutre / Fred Hemery / B. Note / /

/

Position

Author / first author / last author for the experiment / representative / domains Pm / r.n. / model / /

PublishedMedium

the National / /

Technology

cryptography / dom / artificial intelligence / /

URL

http /

SocialTag