Difference between revisions of "Yan Radovilsky"
GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Yan Radovilsky''' FILE:YanRadovilsky.jpg|border|right|thumb|200px|link=https://www.cs.bgu.ac.il/~yanr/| Yan Radovilsky <ref>[https://ww...") |
GerdIsenberg (talk | contribs) |
||
Line 16: | Line 16: | ||
* [[Yan Radovilsky]], [[Solomon Eyal Shimony]] ('''2004'''). ''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]], [[Solomon Eyal Shimony]] ('''2004'''). ''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]], [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] | + | * [[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] |
=External Links= | =External Links= |
Revision as of 10:12, 15 May 2020
Home * People * Yan Radovilsky
Yan Radovilsky,
an Israeli chess player [2],
computer scientist, computer software professional and lecturer at Ben-Gurion University of the Negev.
The main areas of his interest is AI, chess and psychology.
Along with Solomon Eyal Shimony [3],
Yan Radovilsky 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 [4]
to allow for planning steps, as well as game tree search steps.
A rudimentary system employing these ideas for chess was implemented with promising empirical results.
Selected Publications
- Yan Radovilsky, Solomon Eyal Shimony (2004). Generalized Model for Rational Game Tree Search. SMC 2004, pdf [6]
- Yan Radovilsky, Guy Shattah, Solomon Eyal Shimony (2006). Efficient Deterministic Approximation Algorithms for Non-myopic Value of Information in Graphical Models. SMC 2006
- Yan Radovilsky, Solomon Eyal Shimony (2008). Observation Subset Selection as Local Compilation of Performance Profiles. 24. UAI 2008, arXiv:1206.3283
External Links
References
- ↑ Yan's homepage
- ↑ Radovilsky, Yan FIDE Chess Profile
- ↑ Yan Radovilsky, Solomon Eyal Shimony (2004). Generalized Model for Rational Game Tree Search. pdf
- ↑ Eric B. Baum, Warren D. Smith (1995). Best Play for Imperfect Players and Game Tree Search. Part I - theory, with pseudocode appendix by Charles Garrett
- ↑ dblp: Yan Radovilsky
- ↑ Re: Interesting ideas by Karlo Bala Jr., CCC, September 09, 2015