|
Search the dblp DataBase
Shaul Markovitch:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- David Carmel, Shaul Markovitch
Learning Models of Intelligent Agents. [Citation Graph (0, 0)][DBLP] AAAI/IAAI, Vol. 1, 1996, pp:62-67 [Conf]
- David Carmel, Shaul Markovitch
Incorporating Opponent Models into Adversary Search. [Citation Graph (0, 0)][DBLP] AAAI/IAAI, Vol. 1, 1996, pp:120-125 [Conf]
- Dmitry Davidov, Shaul Markovitch
Multiple-Goal Search Algorithms and their Application to Web Crawling. [Citation Graph (0, 0)][DBLP] AAAI/IAAI, 2002, pp:713-718 [Conf]
- Saher Esmeir, Shaul Markovitch
Anytime Induction of Decision Trees: An Iterative Improvement Approach. [Citation Graph (0, 0)][DBLP] AAAI, 2006, pp:- [Conf]
- Saher Esmeir, Shaul Markovitch
When a Decision Tree Learner Has Plenty of Time. [Citation Graph (0, 0)][DBLP] AAAI, 2006, pp:- [Conf]
- Lev Finkelstein, Shaul Markovitch, Ehud Rivlin
Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Independent Processes. [Citation Graph (0, 0)][DBLP] AAAI/IAAI, 2002, pp:719-724 [Conf]
- Evgeniy Gabrilovich, Shaul Markovitch
Overcoming the Brittleness Bottleneck using Wikipedia: Enhancing Text Categorization with Encyclopedic Knowledge. [Citation Graph (0, 0)][DBLP] AAAI, 2006, pp:- [Conf]
- Nela Gurevich, Shaul Markovitch, Ehud Rivlin
Active Learning with Near Misses. [Citation Graph (0, 0)][DBLP] AAAI, 2006, pp:- [Conf]
- Oleg Ledeniov, Shaul Markovitch
Learning Investment Functions for Controlling the Utility of Control Knowledge. [Citation Graph (0, 0)][DBLP] AAAI/IAAI, 1998, pp:463-468 [Conf]
- Michael Lindenbaum, Shaul Markovitch, Dmitry Rusakov
Selective Sampling for Nearest Neighbor Classifiers. [Citation Graph (0, 0)][DBLP] AAAI/IAAI, 1999, pp:366-371 [Conf]
- Ido Dagan, Shaul Marcus, Shaul Markovitch
Contextual Word Similarity and Estimation from Sparse Data. [Citation Graph (0, 0)][DBLP] ACL, 1993, pp:164-171 [Conf]
- David Carmel, Shaul Markovitch
How to Explore your Opponent's Strategy (almost) Optimally. [Citation Graph (0, 0)][DBLP] ICMAS, 1998, pp:64-71 [Conf]
- Saher Esmeir, Shaul Markovitch
Lookahead-based algorithms for anytime induction of decision trees. [Citation Graph (0, 0)][DBLP] ICML, 2004, pp:- [Conf]
- Evgeniy Gabrilovich, Shaul Markovitch
Text categorization with many redundant features: using aggressive feature selection to make SVMs competitive with C4.5. [Citation Graph (0, 0)][DBLP] ICML, 2004, pp:- [Conf]
- Shaul Markovitch, Paul D. Scott
The Role of Forgetting in Learning. [Citation Graph (0, 0)][DBLP] ML, 1988, pp:459-465 [Conf]
- Shaul Markovitch, Paul D. Scott
Information Filters and Their Implementation in the SYLLOG System. [Citation Graph (0, 0)][DBLP] ML, 1989, pp:404-407 [Conf]
- Paul D. Scott, Shaul Markovitch
Uncertainty Based Selection of Learning Experiences. [Citation Graph (0, 0)][DBLP] ML, 1989, pp:358-361 [Conf]
- David Carmel, Shaul Markovitch
Opponent Modeling in Multi-Agent Systems. [Citation Graph (0, 0)][DBLP] Adaption and Learning in Multi-Agent Systems, 1995, pp:40-52 [Conf]
- David Carmel, Shaul Markovitch
Exploration and Adaptation in Multiagent Systems: A Model-based Approach. [Citation Graph (0, 0)][DBLP] IJCAI (1), 1997, pp:606-611 [Conf]
- Evgeniy Gabrilovich, Shaul Markovitch
Feature Generation for Text Categorization Using World Knowledge. [Citation Graph (0, 0)][DBLP] IJCAI, 2005, pp:1048-1053 [Conf]
- Yaniv Hamo, Shaul Markovitch
The COMPSET Algorithm for Subset Selection. [Citation Graph (0, 0)][DBLP] IJCAI, 2005, pp:728-733 [Conf]
- Shaul Markovitch, Paul D. Scott
Utilization Filtering: A Method for Reducing the Inherent Harmfulness of Deductively Learned Knowledge. [Citation Graph (0, 0)][DBLP] IJCAI, 1989, pp:738-743 [Conf]
- Shaul Markovitch, Yaron Sella
Learning of Resource Allocation Strategies for Game Playing. [Citation Graph (0, 0)][DBLP] IJCAI, 1993, pp:974-979 [Conf]
- Paul D. Scott, Shaul Markovitch
Learning Novel Domains Through Curiosity and Conjecture. [Citation Graph (0, 0)][DBLP] IJCAI, 1989, pp:669-674 [Conf]
- Saher Esmeir, Shaul Markovitch
Occam's Razor Just Got Sharper. [Citation Graph (0, 0)][DBLP] IJCAI, 2007, pp:768-773 [Conf]
- Evgeniy Gabrilovich, Shaul Markovitch
Computing Semantic Relatedness Using Wikipedia-based Explicit Semantic Analysis. [Citation Graph (0, 0)][DBLP] IJCAI, 2007, pp:1606-1611 [Conf]
- Dmitry Davidov, Evgeniy Gabrilovich, Shaul Markovitch
Parameterized generation of labeled datasets for text categorization based on a hierarchical directory. [Citation Graph (0, 0)][DBLP] SIGIR, 2004, pp:250-257 [Conf]
- Shaul Markovitch, Paul D. Scott
Automatic Ordering of Subgoals - A Machine Learning Approach. [Citation Graph (0, 0)][DBLP] NACLP, 1989, pp:224-240 [Conf]
- Shaul Markovitch, Ronit Reger
Learning and Exploiting Relative Weaknesses of Opponent Agents. [Citation Graph (0, 0)][DBLP] Autonomous Agents and Multi-Agent Systems, 2005, v:10, n:2, pp:103-130 [Journal]
- David Carmel, Shaul Markovitch
Exploration Strategies for Model-based Learning in Multi-agent Systems: Exploration Strategies. [Citation Graph (0, 0)][DBLP] Autonomous Agents and Multi-Agent Systems, 1999, v:2, n:2, pp:141-172 [Journal]
- David Carmel, Shaul Markovitch
Pruning Algorithms for Multi-Model Adversary Search. [Citation Graph (0, 0)][DBLP] Artif. Intell., 1998, v:99, n:2, pp:325-355 [Journal]
- Lev Finkelstein, Shaul Markovitch
Optimal schedules for monitoring anytime algorithms. [Citation Graph (0, 0)][DBLP] Artif. Intell., 2001, v:126, n:1-2, pp:63-108 [Journal]
- Shaul Markovitch, Yaron Sella
Learning of Resource Allocation Strategies for Game Playing. [Citation Graph (0, 0)][DBLP] Computational Intelligence, 1996, v:12, n:, pp:88-105 [Journal]
- Lev Finkelstein, Shaul Markovitch
A Selective Macro-learning Algorithm and its Application to the NxN Sliding-Tile Puzzle [Citation Graph (0, 0)][DBLP] CoRR, 1998, v:0, n:, pp:- [Journal]
- Lev Finkelstein, Shaul Markovitch
A Selective Macro-learning Algorithm and its Application to the NxN Sliding-Tile Puzzle. [Citation Graph (0, 0)][DBLP] J. Artif. Intell. Res. (JAIR), 1998, v:8, n:, pp:223-263 [Journal]
- Lev Finkelstein, Shaul Markovitch, Ehud Rivlin
Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Shared Resources. [Citation Graph (0, 0)][DBLP] J. Artif. Intell. Res. (JAIR), 2003, v:19, n:, pp:73-138 [Journal]
- Orna Grumberg, Shlomi Livne, Shaul Markovitch
Learning to Order BDD Variables in Verification. [Citation Graph (0, 0)][DBLP] J. Artif. Intell. Res. (JAIR), 2003, v:18, n:, pp:83-116 [Journal]
- Oleg Ledeniov, Shaul Markovitch
The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference. [Citation Graph (0, 0)][DBLP] J. Artif. Intell. Res. (JAIR), 1998, v:9, n:, pp:37-97 [Journal]
- David Carmel, Shaul Markovitch
Model-based learning of interaction strategies in multi-agent systems. [Citation Graph (0, 0)][DBLP] J. Exp. Theor. Artif. Intell., 1998, v:10, n:3, pp:309-332 [Journal]
- Shaul Markovitch, Asaf Shatil
Speedup Learning for Repair-based Search by Identifying Redundant Steps. [Citation Graph (0, 0)][DBLP] Journal of Machine Learning Research, 2003, v:4, n:, pp:649-682 [Journal]
- Asaf Amit, Shaul Markovitch
Learning to bid in bridge. [Citation Graph (0, 0)][DBLP] Machine Learning, 2006, v:63, n:3, pp:287-327 [Journal]
- Michael Lindenbaum, Shaul Markovitch, Dmitry Rusakov
Selective Sampling for Nearest Neighbor Classifiers. [Citation Graph (0, 0)][DBLP] Machine Learning, 2004, v:54, n:2, pp:125-152 [Journal]
- Shaul Markovitch, Dan Rosenstein
Feature Generation Using General Constructor Functions. [Citation Graph (0, 0)][DBLP] Machine Learning, 2002, v:49, n:1, pp:59-98 [Journal]
- Shaul Markovitch, Paul D. Scott
Information Filtering: Selection Mechanisms in Learning Systems. [Citation Graph (0, 0)][DBLP] Machine Learning, 1993, v:10, n:, pp:113-151 [Journal]
- Paul D. Scott, Shaul Markovitch
Experience Selection and Problem Choice in an Exploratory Learning System. [Citation Graph (0, 0)][DBLP] Machine Learning, 1993, v:12, n:, pp:49-67 [Journal]
- Dmitry Davidov, Shaul Markovitch
Multiple-Goal Heuristic Search. [Citation Graph (0, 0)][DBLP] J. Artif. Intell. Res. (JAIR), 2006, v:26, n:, pp:417-451 [Journal]
Concept-Based Feature Generation and Selection for Information Retrieval. [Citation Graph (, )][DBLP]
To Max or Not to Max: Online Learning for Speeding Up Optimal Planning. [Citation Graph (, )][DBLP]
Anytime Induction of Cost-sensitive Trees. [Citation Graph (, )][DBLP]
Predicting theNews of Tomorrow Using Patterns in Web Search Queries. [Citation Graph (, )][DBLP]
Search in 0.047secs, Finished in 0.051secs
|