Switch to: References

Add citations

You must login to add citations.
  1. Iterative state-space reduction for flexible computation.Weixiong Zhang - 2001 - Artificial Intelligence 126 (1-2):109-138.
    Direct download (2 more)  
     
    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.
  • Potential-based bounded-cost search and Anytime Non-Parametric A ⁎.Roni Stern, Ariel Felner, Jur van den Berg, Rami Puzis, Rajat Shah & Ken Goldberg - 2014 - Artificial Intelligence 214 (C):1-25.
  • The increasing cost tree search for optimal multi-agent pathfinding.Guni Sharon, Roni Stern, Meir Goldenberg & Ariel Felner - 2013 - Artificial Intelligence 195 (C):470-495.
  • Average-case analysis of best-first search in two representative directed acyclic graphs.Anup K. Sen, Amitava Bagchi & Weixiong Zhang - 2004 - Artificial Intelligence 155 (1-2):183-206.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Memory-limited model-based diagnosis.Patrick Rodler - 2022 - Artificial Intelligence 305 (C):103681.
  • Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems.Joseph C. Pemberton & Weixiong Zhang - 1996 - Artificial Intelligence 81 (1-2):297-325.
  • Best-first minimax search.Richard E. Korf & David Maxwell Chickering - 1996 - Artificial Intelligence 84 (1-2):299-337.
  • Cut-and-solve: An iterative search strategy for combinatorial optimization problems.Sharlee Climer & Weixiong Zhang - 2006 - Artificial Intelligence 170 (8-9):714-738.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark