10 found
Order:
Disambiguations
Hans Berliner [5]Hans J. Berliner [5]
  1.  7
    The B∗ tree search algorithm: A best-first proof procedure.Hans Berliner - 1979 - Artificial Intelligence 12 (1):23-40.
  2.  8
    Backgammon computer program beats world champion.Hans J. Berliner - 1980 - Artificial Intelligence 14 (2):205-220.
  3.  2
    Pattern knowledge and search:The SUPREM architecture.Hans Berliner & Carl Ebeling - 1989 - Artificial Intelligence 38 (2):161-198.
  4.  9
    B∗ probability based search.Hans J. Berliner & Chris McConnell - 1996 - Artificial Intelligence 86 (1):97-156.
  5.  10
    Measuring the performance potential of chess programs.Hans J. Berliner, Gordon Goetsch, Murray S. Campbell & Carl Ebeling - 1990 - Artificial Intelligence 43 (1):7-20.
  6.  3
    A chronology of computer chess and its literature.Hans J. Berliner - 1978 - Artificial Intelligence 10 (2):201-214.
  7. The SUPREM architecture.Hans Berliner & Carl Ebeling - 1986 - Artificial Intelligence 28 (1):3-8.
  8.  2
    Using chunking to solve chess pawn endgames.Hans Berliner & Murray Campbell - 1984 - Artificial Intelligence 23 (1):97-120.
  9.  8
    Introduction.Hans J. Berliner & Don F. Beal - 1990 - Artificial Intelligence 43 (1):1-5.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  10.  25
    Book reviews. [REVIEW]Hilary Kornblith, Yehuda E. Kalay, Deborah A. Gagnon, Thomas J. Shuell, K. Nicholas Leibovic & Hans Berliner - 1993 - Minds and Machines 3 (2):239-252.