Difference between revisions of "David McAllester"

From Chessprogramming wiki
Jump to: navigation, search
 
(3 intermediate revisions by the same user not shown)
Line 1: Line 1:
 
'''[[Main Page|Home]] * [[People]] * David McAllester'''
 
'''[[Main Page|Home]] * [[People]] * David McAllester'''
  
[[FILE:mcallester16.jpg|border|right|thumb|link=https://ttic.uchicago.edu/~dmcallester/| David McAllester <ref>[https://ttic.uchicago.edu/~dmcallester/ David McAllester's Personal WWW Page]</ref> ]]  
+
[[FILE:mcallester16.jpg|border|right|thumb|200px|link=https://ttic.uchicago.edu/~dmcallester/| David McAllester <ref>[https://ttic.uchicago.edu/~dmcallester/ David McAllester's Personal WWW Page]</ref> ]]  
  
 
'''David Allen McAllester''',<br/>
 
'''David Allen McAllester''',<br/>
an American computer scientist, Professor and Chief Academic Officer at [https://en.wikipedia.org/wiki/Toyota_Technological_Institute_at_Chicago Toyota Technological Institute at Chicago]. He received his B.S., M.S., and Ph.D. degrees from the [[Massachusetts Institute of Technology]] in 1978, 1979, and 1987 respectively. His research interests covers [[Learning|machine learning]] theory, the theory of [[Languages|programming languages]], [https://en.wikipedia.org/wiki/Automated_reasoning automated reasoning], [[Artificial Intelligence|AI]] [[Planning|planning]], [[Games|computer game]] playing, and [https://en.wikipedia.org/wiki/Computational_linguistics computational linguistics]. In 1988, McAllester proposed the [[Best-First|best-first search]] algorithm [[Conspiracy Number Search]], and in 1993, the [[Depth-First|depth-first]] [[Alpha-Beta Conspiracy Search]], republished in 2002 in the [[ICGA Journal#25_1|ICGA Journal]] <ref>[[David McAllester]], [[Deniz Yuret]] ('''2002'''). ''[[Alpha-Beta Conspiracy Search]]''. [[ICGA Journal#25_1|ICGA Journal, Vol. 25, No. 1]]</ref> and mentioned by the [[Deep Blue]] team <ref>[[Murray Campbell]], [[Joe Hoane]], [[Feng-hsiung Hsu]] ('''1999'''). ''Search Control Methods in Deep Blue''. [[AAAI]] Technical Report SS-99-07, [https://pdfs.semanticscholar.org/211d/7268093b4dfce8201e8da321201c6cd349ef.pdf pdf], [https://web.archive.org/web/20160914070926/http://aaaipress.org/Papers/Symposia/Spring/1999/SS-99-07/SS99-07-004.pdf pdf]</ref>.  
+
an American computer scientist, Professor and Chief Academic Officer at [https://en.wikipedia.org/wiki/Toyota_Technological_Institute_at_Chicago Toyota Technological Institute at Chicago]. He received his B.S., M.S., and Ph.D. degrees from the [[Massachusetts Institute of Technology]] in 1978, 1979, and 1987 respectively. His research interests covers [[Learning|machine learning]] theory, the theory of [[Languages|programming languages]], [https://en.wikipedia.org/wiki/Automated_reasoning automated reasoning], [[Artificial Intelligence|AI]] [[Planning|planning]], [[Games|computer game]] playing, and [https://en.wikipedia.org/wiki/Computational_linguistics computational linguistics]. In 1988, McAllester proposed the [[Best-First|best-first search]] algorithm [[Conspiracy Number Search]], and in 1993 along with [[Deniz Yuret]], the [[Depth-First|depth-first]] [[Alpha-Beta Conspiracy Search]], republished in 2002 in the [[ICGA Journal#25_1|ICGA Journal]] <ref>[[David McAllester]], [[Deniz Yuret]] ('''2002'''). ''Alpha-Beta Conspiracy Search''. [[ICGA Journal#25_1|ICGA Journal, Vol. 25, No. 1]]</ref> and mentioned by the [[Deep Blue]] team <ref>[[Murray Campbell]], [[Joe Hoane]], [[Feng-hsiung Hsu]] ('''1999'''). ''Search Control Methods in Deep Blue''. [[AAAI]] Technical Report SS-99-07, [https://pdfs.semanticscholar.org/211d/7268093b4dfce8201e8da321201c6cd349ef.pdf pdf], [https://web.archive.org/web/20160914070926/http://aaaipress.org/Papers/Symposia/Spring/1999/SS-99-07/SS99-07-004.pdf pdf]</ref>.  
  
 
=Selected Publications=  
 
=Selected Publications=  
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database](pdf)</ref> <ref>[http://dblp.uni-trier.de/pers/hd/m/McAllester:David_A= DBLP: David A. McAllester]</ref>
+
<ref>[[ICGA Journal#RefDB|ICGA Reference Database]]</ref> <ref>[http://dblp.uni-trier.de/pers/hd/m/McAllester:David_A= DBLP: David A. McAllester]</ref>
 
==1985 ...==
 
==1985 ...==
 
* [[David McAllester]] ('''1985'''). ''A New Procedure for Growing Minimax Trees''. Technical Report, Artificial Intelligence Laboratory, [[Massachusetts Institute of Technology|MIT]]
 
* [[David McAllester]] ('''1985'''). ''A New Procedure for Growing Minimax Trees''. Technical Report, Artificial Intelligence Laboratory, [[Massachusetts Institute of Technology|MIT]]

Latest revision as of 16:26, 16 November 2020

Home * People * David McAllester

David McAllester [1]

David Allen McAllester,
an American computer scientist, Professor and Chief Academic Officer at Toyota Technological Institute at Chicago. He received his B.S., M.S., and Ph.D. degrees from the Massachusetts Institute of Technology in 1978, 1979, and 1987 respectively. His research interests covers machine learning theory, the theory of programming languages, automated reasoning, AI planning, computer game playing, and computational linguistics. In 1988, McAllester proposed the best-first search algorithm Conspiracy Number Search, and in 1993 along with Deniz Yuret, the depth-first Alpha-Beta Conspiracy Search, republished in 2002 in the ICGA Journal [2] and mentioned by the Deep Blue team [3].

Selected Publications

[4] [5]

1985 ...

1990 ...

2000 ...

External Links

References

Up one level