Switch to: Citations

Add references

You must login to add references.
  1. Searching for an optimal path in a tree with random costs.Richard M. Karp & Judea Pearl - 1983 - Artificial Intelligence 21 (1-2):99-116.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Phase transitions in artificial intelligence systems.Bernardo A. Huberman & Tad Hogg - 1987 - Artificial Intelligence 33 (2):155-171.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Partial constraint satisfaction.Eugene C. Freuder & Richard J. Wallace - 1992 - Artificial Intelligence 58 (1-3):21-70.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems.Steven Minton, Mark D. Johnston, Andrew B. Philips & Philip Laird - 1992 - Artificial Intelligence 58 (1-3):161-205.
    Download  
     
    Export citation  
     
    Bookmark   19 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  
  • 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  
  • Performance of linear-space search algorithms.Weixiong Zhang & Richard E. Korf - 1995 - Artificial Intelligence 79 (2):241-292.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • 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