25,161
edits
Changes
Created page with "'''Home * People * Ashish Sabharwal''' FILE::AshishSabharwal.jpg|border|right|thumb|link=http://ashishs.people.allenai.org/| Ashish Sabharwal <ref>[http:/..."
'''[[Main Page|Home]] * [[People]] * Ashish Sabharwal'''
[[FILE::AshishSabharwal.jpg|border|right|thumb|link=http://ashishs.people.allenai.org/| Ashish Sabharwal <ref>[http://ashishs.people.allenai.org/ Ashish Sabharwal]</ref> ]]
'''Ashish Sabharwal''',<br/>
an [https://en.wikipedia.org/wiki/Indian_Americans Indian American] mathematician, computer scientist, and senior research scientist at the [https://en.wikipedia.org/wiki/Allen_Institute_for_Artificial_Intelligence Allen Institute for Artificial Intelligence] (AI2) <ref>[http://allenai.org/ Allen Institute for Artificial Intelligence]</ref>, exploring new avenues in [https://en.wikipedia.org/wiki/Statistical_relational_learning probabilistic inference], combinatorial reasoning, and [https://en.wikipedia.org/wiki/Discrete_optimization discrete optimization]. Before, he spent at [https://en.wikipedia.org/wiki/Thomas_J._Watson_Research_Center Thomas J. Watson Research Center] and [https://en.wikipedia.org/wiki/Cornell_University Cornell University]. He defended his Ph.D. in 2005 from [https://en.wikipedia.org/wiki/University_of_Washington University of Washington], [https://en.wikipedia.org/wiki/Seattle Seattle] on algorithmic applications of [https://en.wikipedia.org/wiki/Propositional_proof_system propositional proof] [https://en.wikipedia.org/wiki/Proof_complexity complexity], [https://en.wikipedia.org/wiki/Boolean_satisfiability_problem SAT solvers], after graduating from the [https://en.wikipedia.org/wiki/Indian_Institutes_of_Technology Indian Institute of Technology], [https://en.wikipedia.org/wiki/Kanpur Kanpur]. Along with [[Raghuram Ramanujan]] and [[Bart Selman]], Ashish Sabharwal researched on properties of adversarial search spaces that play a key role in the success or failure of [[UCT]] and similar sampling-based approaches <ref>[[Raghuram Ramanujan]], [[Ashish Sabharwal]], [[Bart Selman]] ('''2010'''). ''[http://www.aaai.org/ocs/index.php/ICAPS/ICAPS10/paper/view/1458 On Adversarial Search Spaces and Sampling-Based Planning]''. [http://www.aaai.org/Press/Proceedings/icaps10.php ICAPS 2010]</ref>.
=Selected Publications=
<ref>[http://dblp.uni-trier.de/pers/hd/s/Sabharwal:Ashish dblp: Ashish Sabharwal]</ref>
==2005 ...==
* [[Ashish Sabharwal]] ('''2005'''). ''Algorithmic Applications of Propositional Proof Complexity''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Washington University of Washington], [http://researcher.ibm.com/researcher/files/us-ashish.sabharwal/thesis-singlesp.pdf pdf]
* [http://www.cs.cornell.edu/gomes/ Carla P. Gomes], [[Ashish Sabharwal]], [[Bart Selman]] ('''2006'''). ''Model Counting: A New Strategy for Obtaining Good Bounds''. [[AAAI|AAAI 2006]], [https://www.cs.ubc.ca/~hutter/EARG.shtml/earg/papers06/xorCountingAAAI06.pdf pdf], [http://www.cs.cornell.edu/gomes/TALKS/xorCountingAAAI06-1.pdf slides as pdf]
* [http://www.cs.cornell.edu/~kroc/ Lukas Kroc], [[Ashish Sabharwal]], [[Bart Selman]] ('''2008, 2011'''). ''[http://link.springer.com/article/10.1007%2Fs10479-009-0680-7 Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting]''. [http://dblp.uni-trier.de/db/conf/cpaior/cpaior2008.html#KrocSS08 CPAIOR 2008], [http://dblp.uni-trier.de/db/journals/anor/anor184.html#KrocSS11 Annals of Operations Research, Vol. 184]
==2010 ...==
* [[Raghuram Ramanujan]], [[Ashish Sabharwal]], [[Bart Selman]] ('''2010'''). ''[http://www.aaai.org/ocs/index.php/ICAPS/ICAPS10/paper/view/1458 On Adversarial Search Spaces and Sampling-Based Planning]''. [http://www.aaai.org/Press/Proceedings/icaps10.php ICAPS 2010] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=66125 Search traps in MCTS and chess] by [[Daniel Shawul]], [[CCC]], December 25, 2017</ref>
* [[Ashish Sabharwal]], [[Horst Samulowitz]], [[Chandra Reddy]] ('''2012'''). ''[http://link.springer.com/chapter/10.1007%2F978-3-642-29828-8_23 Guiding Combinatorial Optimization with UCT]''. [http://dblp.uni-trier.de/db/conf/cpaior/cpaior2012.html#SabharwalSR12 CPAIOR 2012], [http://web.emn.fr/x-info/cpaior-2012/uploads/Abstracts/CPAIOR%20-%2072980356.pdf abstract as pdf], [http://www.cs.toronto.edu/~horst/cogrobo/papers/uctmip.pdf draft as pdf]
* [[Raghuram Ramanujan]], [[Ashish Sabharwal]], [[Bart Selman]] ('''2012'''). ''Understanding Sampling Style Adversarial Search Methods''. [http://arxiv.org/abs/1203.4011 arXiv:1203.4011]
* [[Ashish Sabharwal]], [[Horst Samulowitz]] ('''2014'''). ''Insights into Parallelism with Intensive Knowledge Sharing''. [http://dblp.uni-trier.de/db/conf/cp/cp2014.html#SabharwalS14 CP 2014], [http://www.cs.toronto.edu/~horst/cogrobo/papers/KnowledgeSharingSAT.pdf pdf]
=External Links=
* [http://ashishs.people.allenai.org/ Ashish Sabharwal]
* [http://www.cs.cornell.edu/~sabhar/ Ashish Sabharwal's Homepage at Cornell University]
* [https://scholar.google.com/citations?user=7VspfeAAAAAJ Ashish Sabharwal - Google Scholar Citations]
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=55197 The Mathematics Genealogy Project - Ashish Sabharwal]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE::AshishSabharwal.jpg|border|right|thumb|link=http://ashishs.people.allenai.org/| Ashish Sabharwal <ref>[http://ashishs.people.allenai.org/ Ashish Sabharwal]</ref> ]]
'''Ashish Sabharwal''',<br/>
an [https://en.wikipedia.org/wiki/Indian_Americans Indian American] mathematician, computer scientist, and senior research scientist at the [https://en.wikipedia.org/wiki/Allen_Institute_for_Artificial_Intelligence Allen Institute for Artificial Intelligence] (AI2) <ref>[http://allenai.org/ Allen Institute for Artificial Intelligence]</ref>, exploring new avenues in [https://en.wikipedia.org/wiki/Statistical_relational_learning probabilistic inference], combinatorial reasoning, and [https://en.wikipedia.org/wiki/Discrete_optimization discrete optimization]. Before, he spent at [https://en.wikipedia.org/wiki/Thomas_J._Watson_Research_Center Thomas J. Watson Research Center] and [https://en.wikipedia.org/wiki/Cornell_University Cornell University]. He defended his Ph.D. in 2005 from [https://en.wikipedia.org/wiki/University_of_Washington University of Washington], [https://en.wikipedia.org/wiki/Seattle Seattle] on algorithmic applications of [https://en.wikipedia.org/wiki/Propositional_proof_system propositional proof] [https://en.wikipedia.org/wiki/Proof_complexity complexity], [https://en.wikipedia.org/wiki/Boolean_satisfiability_problem SAT solvers], after graduating from the [https://en.wikipedia.org/wiki/Indian_Institutes_of_Technology Indian Institute of Technology], [https://en.wikipedia.org/wiki/Kanpur Kanpur]. Along with [[Raghuram Ramanujan]] and [[Bart Selman]], Ashish Sabharwal researched on properties of adversarial search spaces that play a key role in the success or failure of [[UCT]] and similar sampling-based approaches <ref>[[Raghuram Ramanujan]], [[Ashish Sabharwal]], [[Bart Selman]] ('''2010'''). ''[http://www.aaai.org/ocs/index.php/ICAPS/ICAPS10/paper/view/1458 On Adversarial Search Spaces and Sampling-Based Planning]''. [http://www.aaai.org/Press/Proceedings/icaps10.php ICAPS 2010]</ref>.
=Selected Publications=
<ref>[http://dblp.uni-trier.de/pers/hd/s/Sabharwal:Ashish dblp: Ashish Sabharwal]</ref>
==2005 ...==
* [[Ashish Sabharwal]] ('''2005'''). ''Algorithmic Applications of Propositional Proof Complexity''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Washington University of Washington], [http://researcher.ibm.com/researcher/files/us-ashish.sabharwal/thesis-singlesp.pdf pdf]
* [http://www.cs.cornell.edu/gomes/ Carla P. Gomes], [[Ashish Sabharwal]], [[Bart Selman]] ('''2006'''). ''Model Counting: A New Strategy for Obtaining Good Bounds''. [[AAAI|AAAI 2006]], [https://www.cs.ubc.ca/~hutter/EARG.shtml/earg/papers06/xorCountingAAAI06.pdf pdf], [http://www.cs.cornell.edu/gomes/TALKS/xorCountingAAAI06-1.pdf slides as pdf]
* [http://www.cs.cornell.edu/~kroc/ Lukas Kroc], [[Ashish Sabharwal]], [[Bart Selman]] ('''2008, 2011'''). ''[http://link.springer.com/article/10.1007%2Fs10479-009-0680-7 Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting]''. [http://dblp.uni-trier.de/db/conf/cpaior/cpaior2008.html#KrocSS08 CPAIOR 2008], [http://dblp.uni-trier.de/db/journals/anor/anor184.html#KrocSS11 Annals of Operations Research, Vol. 184]
==2010 ...==
* [[Raghuram Ramanujan]], [[Ashish Sabharwal]], [[Bart Selman]] ('''2010'''). ''[http://www.aaai.org/ocs/index.php/ICAPS/ICAPS10/paper/view/1458 On Adversarial Search Spaces and Sampling-Based Planning]''. [http://www.aaai.org/Press/Proceedings/icaps10.php ICAPS 2010] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=66125 Search traps in MCTS and chess] by [[Daniel Shawul]], [[CCC]], December 25, 2017</ref>
* [[Ashish Sabharwal]], [[Horst Samulowitz]], [[Chandra Reddy]] ('''2012'''). ''[http://link.springer.com/chapter/10.1007%2F978-3-642-29828-8_23 Guiding Combinatorial Optimization with UCT]''. [http://dblp.uni-trier.de/db/conf/cpaior/cpaior2012.html#SabharwalSR12 CPAIOR 2012], [http://web.emn.fr/x-info/cpaior-2012/uploads/Abstracts/CPAIOR%20-%2072980356.pdf abstract as pdf], [http://www.cs.toronto.edu/~horst/cogrobo/papers/uctmip.pdf draft as pdf]
* [[Raghuram Ramanujan]], [[Ashish Sabharwal]], [[Bart Selman]] ('''2012'''). ''Understanding Sampling Style Adversarial Search Methods''. [http://arxiv.org/abs/1203.4011 arXiv:1203.4011]
* [[Ashish Sabharwal]], [[Horst Samulowitz]] ('''2014'''). ''Insights into Parallelism with Intensive Knowledge Sharing''. [http://dblp.uni-trier.de/db/conf/cp/cp2014.html#SabharwalS14 CP 2014], [http://www.cs.toronto.edu/~horst/cogrobo/papers/KnowledgeSharingSAT.pdf pdf]
=External Links=
* [http://ashishs.people.allenai.org/ Ashish Sabharwal]
* [http://www.cs.cornell.edu/~sabhar/ Ashish Sabharwal's Homepage at Cornell University]
* [https://scholar.google.com/citations?user=7VspfeAAAAAJ Ashish Sabharwal - Google Scholar Citations]
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=55197 The Mathematics Genealogy Project - Ashish Sabharwal]
=References=
<references />
'''[[People|Up one level]]'''
