Switch to: Citations

Add references

You must login to add references.
  1. 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  
  • The TSP phase transition.Ian P. Gent & Toby Walsh - 1996 - Artificial Intelligence 88 (1-2):349-358.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Easy problems are sometimes hard.Ian P. Gent & Toby Walsh - 1994 - Artificial Intelligence 70 (1-2):335-345.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Search rearrangement backtracking and polynomial average time.Paul Walton Purdom - 1983 - Artificial Intelligence 21 (1-2):117-133.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Experimental evaluation of preprocessing algorithms for constraint satisfaction problems.Rina Dechter & Itay Meiri - 1994 - Artificial Intelligence 68 (2):211-241.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition.Rina Dechter - 1990 - Artificial Intelligence 41 (3):273-312.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • Partial constraint satisfaction.Eugene C. Freuder & Richard J. Wallace - 1992 - Artificial Intelligence 58 (1-3):21-70.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • Increasing tree search efficiency for constraint satisfaction problems.Robert M. Haralick & Gordon L. Elliott - 1980 - Artificial Intelligence 14 (3):263-313.
    Download  
     
    Export citation  
     
    Bookmark   40 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  
  • Exploiting the deep structure of constraint problems.Colin P. Williams & Tad Hogg - 1994 - Artificial Intelligence 70 (1-2):73-117.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-5d8df9484f-nsbkm uwo