Changes

Jump to: navigation, search

Solomon Eyal Shimony

7,871 bytes added, 12:26, 15 May 2020
Created page with "'''Home * People * Solomon Eyal Shimony''' FILE:SEShimony.jpg|border|right|thumb|link=https://www.cs.bgu.ac.il/~shimony/| Solomon E. Shimony <ref>[https:..."
'''[[Main Page|Home]] * [[People]] * Solomon Eyal Shimony'''

[[FILE:SEShimony.jpg|border|right|thumb|link=https://www.cs.bgu.ac.il/~shimony/| Solomon E. Shimony <ref>[https://www.cs.bgu.ac.il/~shimony/ Solomon Eyal Shimony]</ref> ]]

'''Solomon Eyal Shimony''',<br/>
an Israeli mathematician, computer scientist and associate professor at [https://en.wikipedia.org/wiki/Ben-Gurion_University_of_the_Negev Ben-Gurion University of the Negev].
His research interest covers [[Artificial Intelligence|artificial intelligence]], with a focus on uncertain reasoning and its applications.
In their 2004 paper ''Generalized Model for Rational Game Tree Search''
<ref>[[Yan Radovilsky]], [[Solomon Eyal Shimony]] ('''2004'''). ''[https://www.semanticscholar.org/paper/Generalized-model-for-rational-game-tree-search-Radovilsky-Shimony/47a32301e705acdc46856d4b29bfc4f50d5ce000 Generalized Model for Rational Game Tree Search]''. [https://dblp.uni-trier.de/db/conf/smc/smc2004-2.html SMC 2004], [https://www.cs.bgu.ac.il/~yanr/Publications/smc04.pdf pdf]</ref>,
[[Yan Radovilsky]] and Solomon Eyal Shimony proposed a generalization of the [[BPIP-DFISA]] (Best play for imperfect players - Depth free independent staircase approximation) search control model introduced by [[Eric B. Baum]] and [[Warren D. Smith]] in 1995 <ref>[[Eric B. Baum]], [[Warren D. Smith]] ('''1995'''). ''[https://www.semanticscholar.org/paper/Best-Play-for-Imperfect-Players-and-Game-Tree-part-Baum-Warren/5838432c92c8905c7066962400c55ddc8803f11a Best Play for Imperfect Players and Game Tree Search]''. Part I - theory, with pseudocode appendix by [[Charles Garrett]]</ref>
to allow for [[Planning|planning]] steps, as well as [[Search|game tree search]] steps.
A rudimentary system employing these ideas for chess was implemented with promising empirical results.
Along with [[David Tolpin]], he researched and published on [[Monte-Carlo Tree Search]] and [[UCT]] <ref>[[David Tolpin]], [[Solomon Eyal Shimony]] ('''2012'''). ''MCTS Based on Simple Regret''. [[Conferences#AAAI-2012|AAAI-2012]], [https://arxiv.org/abs/1207.5536 arXiv:1207.5536]</ref>.

=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/s/Shimony:Solomon_Eyal dblp: Solomon Eyal Shimony]</ref>
==1990 ...==
* [[Solomon Eyal Shimony]], [[Mathematician#ECharniak|Eugene Charniak]] ('''1990'''). ''A New Algorithm for Finding MAP Assignments to Belief Networks''. [https://dblp.uni-trier.de/db/conf/uai/uai1990.html UAI 1990], [https://arxiv.org/abs/1304.1093 arXiv:1304.1093] <ref>[https://en.wikipedia.org/wiki/Maximum_a_posteriori_estimation Maximum a posteriori estimation (MAP) from Wikipedia]</ref>
* [[Solomon Eyal Shimony]] ('''1991'''). ''Algorithms for Irrelevance-Based Partial MAPs''. [https://dblp.uni-trier.de/db/conf/uai/uai1991.html UAI 1991], [https://arxiv.org/abs/1303.5751 arXiv:1303.5751]
* [[Solomon Eyal Shimony]] ('''1991'''). ''Explanation, Irrelevance, and Statistical Independence''. [[Conferences#AAAI-91|AAAI-91]], [https://www.aaai.org/Papers/AAAI/1991/AAAI91-075.pdf pdf]
* [[Solomon Eyal Shimony]] ('''1991'''). ''A probabilistic framework for explanation''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Brown_University Brown University], advisor [[Mathematician#ECharniak|Eugene Charniak]]
* [[Solomon Eyal Shimony]] ('''1993'''). ''Relevant Explanations: Allowing Disjunctive Assignments''. [https://dblp.uni-trier.de/db/conf/uai/uai1993.html UAI 1993], [https://arxiv.org/abs/1303.1478 arXiv:1303.1478]
* [[Mathematician#ECharniak|Eugene Charniak]], [[Solomon Eyal Shimony]] ('''1994'''). ''[https://www.sciencedirect.com/science/article/abs/pii/0004370294900302 Cost-Based Abduction and MAP Explanation]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_(journal) Artificial Intelligence], Vol. 66, No. 2
* [[Solomon Eyal Shimony]] ('''1994'''). ''[https://www.sciencedirect.com/science/article/abs/pii/0004370294900728 Finding MAPs for Belief Networks is NP-Hard]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_(journal) Artificial Intelligence], Vol. 68, No. 2
* [[Mathematician#MBalaban|Mira Balaban]], [[Solomon Eyal Shimony]] ('''1998'''). ''[http://www.cai.sk/ojs/index.php/cai/article/viewArticle/627 Structured Plans with Sharing and Replication]''. [https://dblp.uni-trier.de/db/journals/cai/cai17.html Computers and Artificial Intelligence, Vol. 17], No. 4, [https://www.cs.bgu.ac.il/~mira/tsh.pdf pdf]
==2000 ...==
* [[Yan Radovilsky]], [[Solomon Eyal Shimony]] ('''2004'''). ''[https://www.semanticscholar.org/paper/Generalized-model-for-rational-game-tree-search-Radovilsky-Shimony/47a32301e705acdc46856d4b29bfc4f50d5ce000 Generalized Model for Rational Game Tree Search]''. [https://dblp.uni-trier.de/db/conf/smc/smc2004-2.html SMC 2004], [https://www.cs.bgu.ac.il/~yanr/Publications/smc04.pdf pdf] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=57560&start=14 Re: Interesting ideas] by [[Karlo Balla|Karlo Bala Jr.]], [[CCC]], September 09, 2015</ref>
* [[Yan Radovilsky]], [https://dblp.uni-trier.de/pers/hd/s/Shattah:Guy Guy Shattah], [[Solomon Eyal Shimony]] ('''2006'''). ''[https://ieeexplore.ieee.org/document/4274255 Efficient Deterministic Approximation Algorithms for Non-myopic Value of Information in Graphical Models]''. [https://dblp.uni-trier.de/db/conf/smc/smc2006.html SMC 2006]
* [[Yan Radovilsky]], [[Solomon Eyal Shimony]] ('''2008'''). ''Observation Subset Selection as Local Compilation of Performance Profiles''. [https://dblp.uni-trier.de/db/conf/uai/uai2008.html 24. UAI 2008], [https://arxiv.org/abs/1206.3283 arXiv:1206.3283]
* [[David Tolpin]], [[Solomon Eyal Shimony]] ('''2009'''). ''Semi-Myopic Sensing Plans for Value Optimization''. [https://arxiv.org/abs/0906.3149 arXiv:0906.3149]
==2010 ...==
* [[David Tolpin]], [[Solomon Eyal Shimony]] ('''2010'''). ''Rational Value of Information Estimation for Measurement Selection''. [https://arxiv.org/abs/1003.5305 arXiv:1003.5305] <ref>[https://en.wikipedia.org/wiki/Value_of_information Value of information (VOI) from Wikipedia]</ref>
* [[David Tolpin]], [[Solomon Eyal Shimony]] ('''2011'''). ''Rational Deployment of CSP Heuristics''. [[Conferences#IJCAI2011|IJCAI-2011]], [https://arxiv.org/abs/1104.1924 arXiv:1104.1924] <ref>[https://en.wikipedia.org/wiki/Constraint_satisfaction_problem Constraint satisfaction problem (CSP) from Wikipedia]</ref>
* [[David Tolpin]], [[Solomon Eyal Shimony]] ('''2011'''). ''Doing Better Than UCT: Rational Monte Carlo Sampling in Trees''. [https://arxiv.org/abs/1108.3711 arXiv:1108.3711]
* [[David Tolpin]], [[Solomon Eyal Shimony]] ('''2012'''). ''MCTS Based on Simple Regret''. [[Conferences#AAAI-2012|AAAI-2012]], [https://arxiv.org/abs/1207.5536 arXiv:1207.5536]
* [[David Tolpin]], [[Solomon Eyal Shimony]] ('''2012'''). ''VOI-aware MCTS''. [https://dblp.uni-trier.de/db/conf/ecai/ecai2012.html ECAI 2012], [https://arxiv.org/abs/1207.5589 arXiv:1207.5589]
* [https://dblp.uni-trier.de/pers/hd/h/Hay:Nicholas Nicholas Hay], [[Stuart Russell]], [[David Tolpin]], [[Solomon Eyal Shimony]] ('''2012'''). ''Selecting Computations: Theory and Applications''. [https://dblp.uni-trier.de/db/conf/uai/uai2012.html UAI 2012], [https://arxiv.org/abs/1408.2048 arXiv:1408.2048]
* [[David Tolpin]], [https://dblp.uni-trier.de/pers/hd/b/Betzalel:Oded Oded Betzalel], [[Ariel Felner]], [[Solomon Eyal Shimony]] ('''2014'''). ''Rational Deployment of Multiple Heuristics in IDA*''. [https://arxiv.org/abs/1411.6593 arXiv:1411.6593]

=External Links=
* [https://www.cs.bgu.ac.il/~shimony/ Solomon Eyal Shimony]
* [http://oldweb.cs.bgu.ac.il/faculty/person/shimony.html Prof. Eyal Shimony]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=90937 Solomon Shimony - The Mathematics Genealogy Project]

=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Shimony]]
[[Category:Researcher|Shimony]]

Navigation menu