Difference between revisions of "Thomas Anantharaman"
GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Thomas Anantharaman''' FILE:ThomasAnantharaman.gif|border|right|thumb|200px|link=http://cs.nyu.edu/cs/review95/node3a.html| Thomas Anan...") |
GerdIsenberg (talk | contribs) |
||
(3 intermediate revisions by the same user not shown) | |||
Line 6: | Line 6: | ||
an Indian born computer statistician specializing in [https://en.wikipedia.org/wiki/Bayesian_inference Bayesian inference] approaches for [https://en.wikipedia.org/wiki/Np_complete NP complete] problems. Anantharaman is known for his work with [[Feng-hsiung Hsu]] from 1985-1990 on [[ChipTest]] and [[Deep Thought]] at [[Carnegie Mellon University]] and the implementation of [[Singular Extensions]]. His 1990 Ph.D. dissertation was about ''A Statistical Study of Selective Min-Max Search in Computer Chess''. | an Indian born computer statistician specializing in [https://en.wikipedia.org/wiki/Bayesian_inference Bayesian inference] approaches for [https://en.wikipedia.org/wiki/Np_complete NP complete] problems. Anantharaman is known for his work with [[Feng-hsiung Hsu]] from 1985-1990 on [[ChipTest]] and [[Deep Thought]] at [[Carnegie Mellon University]] and the implementation of [[Singular Extensions]]. His 1990 Ph.D. dissertation was about ''A Statistical Study of Selective Min-Max Search in Computer Chess''. | ||
− | After teaching at Carnegie Mellon, Thomas Anantharaman currently works as principle scientist in [https://en.wikipedia.org/wiki/Bioinformatics bioinformatics] industry <ref>[https://www.linkedin.com/in/thomas-anantharaman-15a1997/ Thomas Anantharaman | LinkedIn]</ref>. | + | After teaching at Carnegie Mellon, Thomas Anantharaman currently works as principle scientist in the [https://en.wikipedia.org/wiki/Bioinformatics bioinformatics] industry <ref>[https://www.linkedin.com/in/thomas-anantharaman-15a1997/ Thomas Anantharaman | LinkedIn]</ref>. |
=Photos= | =Photos= | ||
Line 14: | Line 14: | ||
=Selected Publications= | =Selected Publications= | ||
− | <ref>[ | + | <ref>[[ICGA Journal#RefDB|ICGA Reference Database]]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/a/Anantharaman:Thomas_S= dblp: Thomas S. Anantharaman]</ref> |
==1988== | ==1988== | ||
* [[Thomas Anantharaman]], [[Murray Campbell]], [[Feng-hsiung Hsu]] ('''1988'''). ''Singular extensions: Adding Selectivity to Brute-Force Searching''. [[AAAI]] Spring Symposium, Computer Game Playing, also in [[ICGA Journal#11_4|ICCA Journal, Vol. 11, No. 4]], and ('''1990''') in [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 43, No. 1 | * [[Thomas Anantharaman]], [[Murray Campbell]], [[Feng-hsiung Hsu]] ('''1988'''). ''Singular extensions: Adding Selectivity to Brute-Force Searching''. [[AAAI]] Spring Symposium, Computer Game Playing, also in [[ICGA Journal#11_4|ICCA Journal, Vol. 11, No. 4]], and ('''1990''') in [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 43, No. 1 | ||
Line 42: | Line 42: | ||
'''[[People|Up one level]]''' | '''[[People|Up one level]]''' | ||
+ | [[Category:Mathematician|Anantharaman]] | ||
+ | [[Category:Researcher|Anantharaman]] | ||
+ | [[Category:Chess Programmer|Anantharaman]] |
Latest revision as of 17:28, 16 November 2020
Home * People * Thomas Anantharaman
Thomas Satyaprakash Anantharaman,
an Indian born computer statistician specializing in Bayesian inference approaches for NP complete problems. Anantharaman is known for his work with Feng-hsiung Hsu from 1985-1990 on ChipTest and Deep Thought at Carnegie Mellon University and the implementation of Singular Extensions. His 1990 Ph.D. dissertation was about A Statistical Study of Selective Min-Max Search in Computer Chess.
After teaching at Carnegie Mellon, Thomas Anantharaman currently works as principle scientist in the bioinformatics industry [2].
Contents
Photos
Murray Campbell, Feng-hsiung Hsu, Thomas Anantharaman, Mike Browne and Andreas Nowatzyk,
after winning the Fredkin Intermediate Prize for Deep Thought's Grandmaster-level performance. [3]
Selected Publications
1988
- Thomas Anantharaman, Murray Campbell, Feng-hsiung Hsu (1988). Singular extensions: Adding Selectivity to Brute-Force Searching. AAAI Spring Symposium, Computer Game Playing, also in ICCA Journal, Vol. 11, No. 4, and (1990) in Artificial Intelligence, Vol. 43, No. 1
1990
- Thomas Anantharaman (1990). A Statistical Study of Selective Min-Max Search in Computer Chess. Ph.D. thesis, Carnegie Mellon University
- Feng-hsiung Hsu, Thomas Anantharaman, Murray Campbell, Andreas Nowatzyk (1990). Deep Thought. Computers, Chess, and Cognition
- Feng-hsiung Hsu, Thomas Anantharaman, Murray Campbell, Andreas Nowatzyk (1990). A Grandmaster Chess Machine. Scientific American, Vol. 263, No. 4, Online Reprint
- Thomas Anantharaman, Murray Campbell, Feng-hsiung Hsu (1990). Singular Extensions: Adding Selectivity to Brute-Force Searching. Artificial Intelligence, Vol. 43, No. 1
1991
- Thomas Anantharaman (1991). Confidently Selecting a Search Heuristic. ICCA Journal, Vol. 14, No. 1
- Thomas Anantharaman (1991). A Statistical Study of Selective Min-Max Search in Computer Chess. ICCA Journal, Vol. 14, No. 1
- Thomas Anantharaman (1991). Extension Heuristics. ICCA Journal, Vol. 14, No. 2
- Thomas Anantharaman (1991). Human Arbiters of Chess Tactics? ICCA Journal, Vol. 14, No. 2
1997
- Thomas Anantharaman (1997). Evaluation Tuning for Computer Chess: Linear Discriminant Methods. ICCA Journal, Vol. 20, No. 4
See also
External Links
References
- ↑ Thomas Ananatharaman, Assistant Professor of Computer Science, Ph.D., Carnegie Mellon University
- ↑ Thomas Anantharaman | LinkedIn
- ↑ Deep Thought team with Fredkin Intermediate Prize 1988, Gift of Feng-hsiung Hsu hosted by The Computer History Museum
- ↑ ICGA Reference Database
- ↑ dblp: Thomas S. Anantharaman