Difference between revisions of "Yan Radovilsky"

From Chessprogramming wiki
Jump to: navigation, search
Line 14: Line 14:
 
=Selected Publications=  
 
=Selected Publications=  
 
<ref>[https://dblp.uni-trier.de/pers/hd/r/Radovilsky:Yan dblp: Yan Radovilsky]</ref>
 
<ref>[https://dblp.uni-trier.de/pers/hd/r/Radovilsky:Yan dblp: Yan Radovilsky]</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]], [[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]], [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]

Revision as of 09:25, 15 May 2020

Home * People * Yan Radovilsky

Yan Radovilsky [1]

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

[5]

External Links

References

Up one level