×
Log in
Upload File
Most Popular
Study
Business
Design
Technology
Travel
Explore all categories
The top documents tagged [hard instances]
NP-complete Problems and Physical Reality Scott Aaronson Institute for Advanced Study
220 views
Lecture 9. Resource bounded KC K-, and C- complexities depend on unlimited computational resources. Kolmogorov himself first observed that we can put resource
217 views
10/7/2014 Constrainedness of Search Toby Walsh NICTA and UNSW tw
220 views
Phase transition behaviour Toby Walsh Dept of CS University of York
216 views
1/19 Minimizing weighted completion time with precedence constraints Nikhil Bansal (IBM) Subhash Khot (NYU)
221 views
SIG New Grad 2010 Vijay Shanker. General Info Research interests: Natural Language Processing, Text Mining, Machine Learning, NLP/Software Engineering
214 views
Search for satisfaction Toby Walsh Cork Constraint Computation Center
[email protected]
215 views
1 KNOWLEDGE REPRESENTATION & REASONING - SAT SAT Problem Definition KR with SAT Tractable Subclasses DPLL Search Algorithm Slides by: Florent Madelaine
219 views
It’s all about the support: a new perspective on the satisfiability problem Danny Vilenchik
214 views
Knowledge Representation II (Inference in Propositional Logic) CSE 473 Continued…
217 views
AAAI00 Austin, Texas
23 views
AAAI00 Austin, Texas
16 views
Next >