25,161
edits
Changes
Created page with "'''Home * People * Lev Finkelstein''' FILE:LevFinkelstein.jpg|border|right|thumb|link=https://www.linkedin.com/in/lev-finkelstein-2836b3/| Lev Finkelstein..."
'''[[Main Page|Home]] * [[People]] * Lev Finkelstein'''
[[FILE:LevFinkelstein.jpg|border|right|thumb|link=https://www.linkedin.com/in/lev-finkelstein-2836b3/| Lev Finkelstein <ref>Image cropped from [https://www.linkedin.com/in/lev-finkelstein-2836b3/ Lev Finkelstein | LinkedIn]</ref> ]]
'''Lev Finkelstein''',<br/>
an Israeli computer scientist and software engineer at [https://en.wikipedia.org/wiki/Google Google] <ref>[https://www.linkedin.com/in/lev-finkelstein-2836b3/ Lev Finkelstein | LinkedIn]</ref>.
He holds a Ph.D. from [https://en.wikipedia.org/wiki/Technion_%E2%80%93_Israel_Institute_of_Technology Technion - Israel Institute of Technology] in 2005 under supervision of [[Shaul Markovitch]] <ref>[[Lev Finkelstein]] ('''2005'''). ''[http://www.graduate.technion.ac.il/Theses/Abstracts.asp?Id=10988 Offline Scheduling of Anytime Algorithms]''. Ph.D thesis, [https://en.wikipedia.org/wiki/Technion_%E2%80%93_Israel_Institute_of_Technology Technion - Israel Institute of Technology], advisor [[Shaul Markovitch]]</ref>.
His research interests include [[Learning|machine learning]], [[Artificial Intelligence|artificial intelligence]] and [https://en.wikipedia.org/wiki/Anytime_algorithm anytime algorithms].
=Learning to Play Chess Selectively=
Talk by Lev Finkelstein, ''Man versus Machine: the Experiment'' 2002 <ref>[https://web.archive.org/web/20040822163301/http://www.cri.haifa.ac.il/events/2002/kasparov/kasparov02.htm Man versus Machine: the Experiment] ([https://en.wikipedia.org/wiki/Wayback_Machine Wayback Machine]), October 15-16, 2002, [https://en.wikipedia.org/wiki/University_of_Haifa University of Haifa]</ref> (abstract):
Several researchers have noted that human chess players do not perceive a position as a static entity, but as a collection of potential actions. Indeed, it looks as if human chess players are able to follow promising moves without considering all the alternatives. This work studies the possibility of incorporating such capabilities into chess programs.
We present a methodology for representing move patterns. A movepattern is a structure consisting of a board pattern and a move that can be applied in that pattern. Move patterns are used for selecting promising branches of the search tree, allowing a narrower, and therefore deeper, search. Move patterns are learned during training games and are stored in an hierarchical structure to enable fast retrieval. The talk describes a language for representing move patterns, and methods for learning and using them.
This research was done in collaboration with [[Shaul Markovitch]].
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/f/Finkelstein:Lev dblp: Lev Finkelstein]</ref>
<ref>[http://www.cs.technion.ac.il/%7Eshaulm/papers/coauthor/Lev-Finkelstein.html Publications of Shaul Markovitch Coauthored with] Lev Finkelstein</ref>
* [[Lev Finkelstein]], [[Shaul Markovitch]] ('''1998'''). ''Learning to Play Chess Selectively by Acquiring Move Patterns.'' [[ICGA Journal#21_2|ICCA Journal, Vol. 21, No. 2]], [http://www.cs.technion.ac.il/%7Eshaulm/papers/pdf/Finkelstein-Markovitch-icca1998.pdf pdf]
* [[Lev Finkelstein]], [[Shaul Markovitch]] ('''1998'''). ''A Selective Macro-learning Algorithm and its Application to the NxN Sliding-Tile Puzzle''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 8, [https://arxiv.org/abs/cs/9806102 arXiv:cs/9806102]
* [[Lev Finkelstein]], [[Shaul Markovitch]], [https://dblp.uni-trier.de/pers/hd/r/Rivlin:Ehud Ehud Rivlin] ('''2003'''). ''Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Shared Resources''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 19, [https://arxiv.org/abs/1106.5269 arXiv:1106.5269]
* [[Lev Finkelstein]] ('''2005'''). ''[http://www.graduate.technion.ac.il/Theses/Abstracts.asp?Id=10988 Offline Scheduling of Anytime Algorithms]''. Ph.D thesis, [https://en.wikipedia.org/wiki/Technion_%E2%80%93_Israel_Institute_of_Technology Technion - Israel Institute of Technology], advisor [[Shaul Markovitch]]
=External Links=
* [https://www.linkedin.com/in/lev-finkelstein-2836b3/ Lev Finkelstein | LinkedIn]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Finkelstein]]
[[FILE:LevFinkelstein.jpg|border|right|thumb|link=https://www.linkedin.com/in/lev-finkelstein-2836b3/| Lev Finkelstein <ref>Image cropped from [https://www.linkedin.com/in/lev-finkelstein-2836b3/ Lev Finkelstein | LinkedIn]</ref> ]]
'''Lev Finkelstein''',<br/>
an Israeli computer scientist and software engineer at [https://en.wikipedia.org/wiki/Google Google] <ref>[https://www.linkedin.com/in/lev-finkelstein-2836b3/ Lev Finkelstein | LinkedIn]</ref>.
He holds a Ph.D. from [https://en.wikipedia.org/wiki/Technion_%E2%80%93_Israel_Institute_of_Technology Technion - Israel Institute of Technology] in 2005 under supervision of [[Shaul Markovitch]] <ref>[[Lev Finkelstein]] ('''2005'''). ''[http://www.graduate.technion.ac.il/Theses/Abstracts.asp?Id=10988 Offline Scheduling of Anytime Algorithms]''. Ph.D thesis, [https://en.wikipedia.org/wiki/Technion_%E2%80%93_Israel_Institute_of_Technology Technion - Israel Institute of Technology], advisor [[Shaul Markovitch]]</ref>.
His research interests include [[Learning|machine learning]], [[Artificial Intelligence|artificial intelligence]] and [https://en.wikipedia.org/wiki/Anytime_algorithm anytime algorithms].
=Learning to Play Chess Selectively=
Talk by Lev Finkelstein, ''Man versus Machine: the Experiment'' 2002 <ref>[https://web.archive.org/web/20040822163301/http://www.cri.haifa.ac.il/events/2002/kasparov/kasparov02.htm Man versus Machine: the Experiment] ([https://en.wikipedia.org/wiki/Wayback_Machine Wayback Machine]), October 15-16, 2002, [https://en.wikipedia.org/wiki/University_of_Haifa University of Haifa]</ref> (abstract):
Several researchers have noted that human chess players do not perceive a position as a static entity, but as a collection of potential actions. Indeed, it looks as if human chess players are able to follow promising moves without considering all the alternatives. This work studies the possibility of incorporating such capabilities into chess programs.
We present a methodology for representing move patterns. A movepattern is a structure consisting of a board pattern and a move that can be applied in that pattern. Move patterns are used for selecting promising branches of the search tree, allowing a narrower, and therefore deeper, search. Move patterns are learned during training games and are stored in an hierarchical structure to enable fast retrieval. The talk describes a language for representing move patterns, and methods for learning and using them.
This research was done in collaboration with [[Shaul Markovitch]].
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/f/Finkelstein:Lev dblp: Lev Finkelstein]</ref>
<ref>[http://www.cs.technion.ac.il/%7Eshaulm/papers/coauthor/Lev-Finkelstein.html Publications of Shaul Markovitch Coauthored with] Lev Finkelstein</ref>
* [[Lev Finkelstein]], [[Shaul Markovitch]] ('''1998'''). ''Learning to Play Chess Selectively by Acquiring Move Patterns.'' [[ICGA Journal#21_2|ICCA Journal, Vol. 21, No. 2]], [http://www.cs.technion.ac.il/%7Eshaulm/papers/pdf/Finkelstein-Markovitch-icca1998.pdf pdf]
* [[Lev Finkelstein]], [[Shaul Markovitch]] ('''1998'''). ''A Selective Macro-learning Algorithm and its Application to the NxN Sliding-Tile Puzzle''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 8, [https://arxiv.org/abs/cs/9806102 arXiv:cs/9806102]
* [[Lev Finkelstein]], [[Shaul Markovitch]], [https://dblp.uni-trier.de/pers/hd/r/Rivlin:Ehud Ehud Rivlin] ('''2003'''). ''Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Shared Resources''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 19, [https://arxiv.org/abs/1106.5269 arXiv:1106.5269]
* [[Lev Finkelstein]] ('''2005'''). ''[http://www.graduate.technion.ac.il/Theses/Abstracts.asp?Id=10988 Offline Scheduling of Anytime Algorithms]''. Ph.D thesis, [https://en.wikipedia.org/wiki/Technion_%E2%80%93_Israel_Institute_of_Technology Technion - Israel Institute of Technology], advisor [[Shaul Markovitch]]
=External Links=
* [https://www.linkedin.com/in/lev-finkelstein-2836b3/ Lev Finkelstein | LinkedIn]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Finkelstein]]
