Switch to: References

Add citations

You must login to add citations.
  1. Automatically generating personalized user interfaces with Supple.Krzysztof Z. Gajos, Daniel S. Weld & Jacob O. Wobbrock - 2010 - Artificial Intelligence 174 (12-13):910-950.
    Download  
     
    Export citation  
     
    Bookmark  
  • Random constraint satisfaction: Easy generation of hard (satisfiable) instances.Ke Xu, Frédéric Boussemart, Fred Hemery & Christophe Lecoutre - 2007 - Artificial Intelligence 171 (8-9):514-534.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Phase transitions and the search problem.Tad Hogg, Bernardo A. Huberman & Colin P. Williams - 1996 - Artificial Intelligence 81 (1-2):1-15.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems.Joseph C. Pemberton & Weixiong Zhang - 1996 - Artificial Intelligence 81 (1-2):297-325.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • An empirical study of phase transitions in binary constraint satisfaction problems.Patrick Prosser - 1996 - Artificial Intelligence 81 (1-2):81-109.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Locating the phase transition in binary constraint satisfaction problems.Barbara M. Smith & Martin E. Dyer - 1996 - Artificial Intelligence 81 (1-2):155-181.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes.P. Parodi, R. Lancewicki, A. Vijh & J. K. Tsotsos - 1998 - Artificial Intelligence 105 (1-2):47-75.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Implicates and prime implicates in Random 3-SAT.Robert Schrag & James M. Crawford - 1996 - Artificial Intelligence 81 (1-2):199-222.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard.Bernd S. W. Schröder - 2001 - Artificial Intelligence 132 (1):105-117.
    Download  
     
    Export citation  
     
    Bookmark  
  • A study of complexity transitions on the asymmetric traveling salesman problem.Weixiong Zhang & Richard E. Korf - 1996 - Artificial Intelligence 81 (1-2):223-239.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Problem structure heuristics and scaling behavior for genetic algorithms.Scott H. Clearwater & Tad Hogg - 1996 - Artificial Intelligence 81 (1-2):327-347.
    Download  
     
    Export citation  
     
    Bookmark  
  • The satisfiability constraint gap.Ian P. Gent & Toby Walsh - 1996 - Artificial Intelligence 81 (1-2):59-80.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The hardest constraint problems: A double phase transition.Tad Hogg & Colin P. Williams - 1994 - Artificial Intelligence 69 (1-2):359-377.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Refining the phase transition in combinatorial search.Tad Hogg - 1996 - Artificial Intelligence 81 (1-2):127-154.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation.Enrico Giunchiglia, Roberto Sebastiani, Fausto Giunchiglia & Armando Tacchella - 2000 - Journal of Applied Non-Classical Logics 10 (2):145-172.
    ABSTRACT This paper follows on previous papers which present and evaluate various decision procedures for modal logics. We consider new test sets and systems that have been recently proposed in the literature. This new experimental analysis confirm previous experimental results in showing that SAT based decision procedures, i.e., the procedures built on top of decision procedures for propositional satisfiability, are more efficient than tableau based decision procedures. They also confirm previous evidence of an easy-hard-easy pattern in the satisfiability curve for (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation