Difference between revisions of "Ashish Sabharwal"

From Chessprogramming wiki
Jump to: navigation, search
 
Line 8: Line 8:
 
=Selected Publications=
 
=Selected Publications=
 
<ref>[http://dblp.uni-trier.de/pers/hd/s/Sabharwal:Ashish dblp: Ashish Sabharwal]</ref>
 
<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]
 
* [[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/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]
 
* [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>
 
* [[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]
 
* [[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]

Latest revision as of 18:00, 3 June 2018

Home * People * Ashish Sabharwal

Ashish Sabharwal [1]

Ashish Sabharwal,
an Indian American mathematician, computer scientist, and senior research scientist at the Allen Institute for Artificial Intelligence (AI2) [2], exploring new avenues in probabilistic inference, combinatorial reasoning, and discrete optimization. Before, he spent at Thomas J. Watson Research Center and Cornell University. He defended his Ph.D. in 2005 from University of Washington, Seattle on algorithmic applications of propositional proof complexity, SAT solvers, after graduating from the Indian Institute of Technology, 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 [3].

Selected Publications

[4]

2005 ...

2010 ...

External Links

References

Up one level