Bruce Abramson

From Chessprogramming wiki
Revision as of 15:01, 23 April 2018 by GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Bruce Abramson''' FILE:BruceAbramson.jpg|border|right|thumb|link=http://www.bdabramson.com/| Bruce Abramson <ref>[http://www.bdabramso...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Home * People * Bruce Abramson

Bruce Abramson [1]

Bruce D. Abramson,
an American computer scientist and jurist. He holds a Ph.D. in Computer Science from Columbia University and a J.D. from Georgetown. He has served on the faculty of the University of Southern California, and as a research adjunct to the faculty of Carnegie Mellon University. His research interests covers Game theory in general with focus on heuristic search and evaluation associated with learning.

Selected Publications

[2]

1985 ...

  • Bruce Abramson (1985). A Cure for Pathological Behavior in Games that Use Minimax. Proceedings of the Workshop on Uncertainty in Artificial Intelligence, 1985, 225-231.
  • Bruce Abramson (1986). An Explanation of and Cure for Minimax Pathology. Uncertainty in Artificial Intelligence, Laveen Kanal and John Lemmer, eds. (Amsterdam: North Holland, 1986), 495-504.
  • Bruce Abramson, Richard Korf (1987). A Model of Two-Player Evaluation Functions. AAAI-87. pdf
  • Bruce Abramson (1988). Learning Expected-Outcome Evaluators in Chess. Proceedings of the 1988 AAAI Spring Symposium Series: Computer Game Playing, 26-28.
  • Bruce Abramson (1989). Control Strategies for Two-Player Games. ACM Computing Surveys, Vol. 21, No. 2
  • Bruce Abramson (1989). On Learning and Testing Evaluation Functions. Proceedings of the Sixth Israeli Conference on Artificial Intelligence, 1989, 7-16.

1990 ...

2000 ...

External Links

References

Up one level