25,161
edits
Changes
no edit summary
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 the [https://en.wikipedia.org/wiki/Bioinformatics bioinformatics] industry <ref>[https://www.linkedin.com/in/thomas-anantharaman-15a1997/ Thomas Anantharaman | LinkedIn]</ref>.
=Photos=
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf [ICGA Journal#RefDB|ICGA Reference Database] (pdf)]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/a/Anantharaman:Thomas_S= dblp: Thomas S. Anantharaman]</ref>
==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
'''[[People|Up one level]]'''
[[Category:Mathematician|Anantharaman]]
[[Category:Researcher|Anantharaman]]
[[Category:Chess Programmer|Anantharaman]]
