Difference between revisions of "Shaul Markovitch"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
Line 20: | Line 20: | ||
* [[David Carmel]], [[Shaul Markovitch]] ('''1994'''). ''[https://www.semanticscholar.org/paper/The-M*-Algorithm%3A-Incorporating-Opponent-Models-Carmel-Markovitch/bd788272c81951dc44fa7944e0f72451ced14129 The M* Algorithm: Incorporating Opponent Models into Adversary Search]''. CIS Report #9402, [http://www.cs.technion.ac.il/~shaulm/papers/pdf/Carmel-Markovitch-CIS9402.pdf pdf] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=54865&start=27 Re: Different eval for white/black] by [[Ronald de Man]], [[CCC]], January 08, 2015</ref> | * [[David Carmel]], [[Shaul Markovitch]] ('''1994'''). ''[https://www.semanticscholar.org/paper/The-M*-Algorithm%3A-Incorporating-Opponent-Models-Carmel-Markovitch/bd788272c81951dc44fa7944e0f72451ced14129 The M* Algorithm: Incorporating Opponent Models into Adversary Search]''. CIS Report #9402, [http://www.cs.technion.ac.il/~shaulm/papers/pdf/Carmel-Markovitch-CIS9402.pdf pdf] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=54865&start=27 Re: Different eval for white/black] by [[Ronald de Man]], [[CCC]], January 08, 2015</ref> | ||
* [[David Carmel]], [[Shaul Markovitch]] ('''1996'''). ''Incorporating Opponent Models into Adversary Search''. [[Conferences#AAAI-96|AAAI 1996]], [http://www.cs.technion.ac.il/~shaulm/papers/pdf/Carmel-Markovitch-aaai1996.pdf pdf] | * [[David Carmel]], [[Shaul Markovitch]] ('''1996'''). ''Incorporating Opponent Models into Adversary Search''. [[Conferences#AAAI-96|AAAI 1996]], [http://www.cs.technion.ac.il/~shaulm/papers/pdf/Carmel-Markovitch-aaai1996.pdf pdf] | ||
+ | * [[David Carmel]], [[Shaul Markovitch]] ('''1998'''). ''[https://dl.acm.org/doi/10.5555/551984.852236 How to Explore your Opponent's Strategy (almost) Optimally]''. [https://dblp.uni-trier.de/db/conf/icmas/icmas1998.html ICMAS 1998] | ||
* [[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'''). ''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]] ('''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] | ||
+ | * [[David Carmel]], [[Shaul Markovitch]] ('''1998'''). ''[http://www.cs.technion.ac.il/~shaulm/papers/abstracts/Carmel-1998-PAM.html Pruning Algorithms for Multi-Model Adversary Search]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_(journal) Artificial Intelligence], Vol. 99, No. 2 | ||
==2000 ...== | ==2000 ...== | ||
* [[Shaul Markovitch]] ('''2002'''). ''Tutorial: How Computers Play Chess''. [[Kasparov versus Deep Junior 2003#Symposium|Man vs Machine Symposium]] | * [[Shaul Markovitch]] ('''2002'''). ''Tutorial: How Computers Play Chess''. [[Kasparov versus Deep Junior 2003#Symposium|Man vs Machine Symposium]] | ||
* [[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]], [[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] | ||
+ | * [https://dblp.org/pers/d/Davidov:Dmitry.html Dmitry Davidov], [[Shaul Markovitch]] ('''2006'''). ''[https://dl.acm.org/doi/10.5555/1622559.1622570 Multiple-Goal Heuristic Search]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 26, [https://arxiv.org/abs/1109.6618 arXiv:1109.6618] | ||
+ | * [https://dblp.uni-trier.de/pers/hd/g/Gabrilovich:Evgeniy Evgeniy Gabrilovich], [[Shaul Markovitch]] ('''2007'''). ''Computing Semantic Relatedness Using Wikipedia-based Explicit Semantic Analysis''. [[Conferences#IJCAI2007|International Joint Conference on Artificial Intelligence 2007]], [https://www.aaai.org/Papers/IJCAI/2007/IJCAI07-259.pdf pdf] | ||
+ | * [https://dblp.uni-trier.de/pers/hd/e/Esmeir:Saher Saher Esmeir], [[Shaul Markovitch]] ('''2007'''). ''Occam's Razor Just Got Sharper''. [[Conferences#IJCAI2007|International Joint Conference on Artificial Intelligence 2007]], [https://www.ijcai.org/Proceedings/07/Papers/123.pdf pdf] | ||
+ | * [https://dblp.uni-trier.de/pers/hd/g/Gabrilovich:Evgeniy Evgeniy Gabrilovich], [[Shaul Markovitch]] ('''2009'''). ''Wikipedia-based Semantic Interpretation for Natural Language Processing''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 34, [https://arxiv.org/abs/1401.5697 arXiv:1401.5697] | ||
+ | ==2010 ...== | ||
+ | * [https://dblp.uni-trier.de/pers/hd/d/Domshlak:Carmel Carmel Domshlak], [https://dblp.uni-trier.de/pers/hd/k/Karpas:Erez Erez Karpas], [[Shaul Markovitch]] ('''2012'''). ''Online Speedup Learning for Optimal Planning''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 44, [https://arxiv.org/abs/1401.5861 arXiv:1401.5861] | ||
+ | * [https://dblp.uni-trier.de/pers/hd/f/Friedman:Lior Lior Friedman], [[Shaul Markovitch]] ('''2018'''). ''Recursive Feature Generation for Knowledge-based Learning''. [https://arxiv.org/abs/1802.00050 arXiv:1802.00050] | ||
+ | ==2020 ...== | ||
+ | * [https://dblp.uni-trier.de/pers/hd/b/Badian:Michal Michal Badian], [[Shaul Markovitch]] ('''2020'''). ''Knowledge-Based Learning through Feature Generation''. [https://arxiv.org/abs/2006.03874 arXiv:2006.03874] | ||
=External Links= | =External Links= |
Revision as of 20:12, 1 July 2020
Home * People * Shaul Markovitch
Shaul Markovitch,
an Israeli computer scientist, AI researcher, and faculty member in the Computer Science department at Technion - Israel Institute of Technology.
His research covers machine learning and AI with the topics selective learning, speedup learning,
feature generation, active learning, learning in multi-agent systems, opponent modeling, game playing, anytime algorithms, resource-bounded reasoning, reasoning under uncertainty, and heuristic search
[2].
Contents
Photos
Shaul Markovitch talks on How Computers Play Chess at the Man vs Machine Symposium, University of Haifa, October 2002 [3]
Selected Publications
1990 ...
- Shaul Markovitch, Yaron Sella (1993). Learning of Resource Allocation Strategies for Game Playing. International Joint Conference on Artificial Intelligence, pdf
- David Carmel, Shaul Markovitch (1993). Learning Models of Opponent's Strategy in Game Playing. AAAI 1993, FS-93-02, pdf
- David Carmel, Shaul Markovitch (1994). The M* Algorithm: Incorporating Opponent Models into Adversary Search. CIS Report #9402, pdf [5]
- David Carmel, Shaul Markovitch (1996). Incorporating Opponent Models into Adversary Search. AAAI 1996, pdf
- David Carmel, Shaul Markovitch (1998). How to Explore your Opponent's Strategy (almost) Optimally. ICMAS 1998
- Lev Finkelstein, Shaul Markovitch (1998). Learning to Play Chess Selectively by Acquiring Move Patterns. ICCA Journal, Vol. 21, No. 2, pdf
- Lev Finkelstein, Shaul Markovitch (1998). A Selective Macro-learning Algorithm and its Application to the NxN Sliding-Tile Puzzle. JAIR, Vol. 8, arXiv:cs/9806102
- David Carmel, Shaul Markovitch (1998). Pruning Algorithms for Multi-Model Adversary Search. Artificial Intelligence, Vol. 99, No. 2
2000 ...
- Shaul Markovitch (2002). Tutorial: How Computers Play Chess. Man vs Machine Symposium
- Lev Finkelstein, Shaul Markovitch, Ehud Rivlin (2003). Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Shared Resources. JAIR, Vol. 19, arXiv:1106.5269
- Dmitry Davidov, Shaul Markovitch (2006). Multiple-Goal Heuristic Search. JAIR, Vol. 26, arXiv:1109.6618
- Evgeniy Gabrilovich, Shaul Markovitch (2007). Computing Semantic Relatedness Using Wikipedia-based Explicit Semantic Analysis. International Joint Conference on Artificial Intelligence 2007, pdf
- Saher Esmeir, Shaul Markovitch (2007). Occam's Razor Just Got Sharper. International Joint Conference on Artificial Intelligence 2007, pdf
- Evgeniy Gabrilovich, Shaul Markovitch (2009). Wikipedia-based Semantic Interpretation for Natural Language Processing. JAIR, Vol. 34, arXiv:1401.5697
2010 ...
- Carmel Domshlak, Erez Karpas, Shaul Markovitch (2012). Online Speedup Learning for Optimal Planning. JAIR, Vol. 44, arXiv:1401.5861
- Lior Friedman, Shaul Markovitch (2018). Recursive Feature Generation for Knowledge-based Learning. arXiv:1802.00050
2020 ...
- Michal Badian, Shaul Markovitch (2020). Knowledge-Based Learning through Feature Generation. arXiv:2006.03874
External Links
- Shaul Markovitch's Home Page
- Shaul Markovitch - Google Scholar Citations
- Shaul Markovitch - YouTube
- Shaul Markovitch, Ziv Cohen, Peer Sagiv, Ilya Smagloy - Shine On You Crazy Diamond, Technion, November 04, 2019, YouTube Video
References
- ↑ Shaul Markovitch's Home Page
- ↑ Shaul Markovitch - Research summary
- ↑ Man vs. Machine: The Experiment October 15-16, 2002, University of Haifa
- ↑ dblp: Shaul Markovitch
- ↑ Re: Different eval for white/black by Ronald de Man, CCC, January 08, 2015