- Exploiting the Cost (In)sensitivity of Decision Tree Splitting Criteria Chris Drummond cdrummon@site.uottawa.ca
- Steps Towards The Automatic Creation of Search Heuristics
- Machine Learning, xx, 1--23 (xxxx) fl xxxx Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- The Tradeoff Between Speed and Optimality in Hierarchical Search
- published in the Proceedings of the 10th Canadian Conference on Artificial Intelligence (AI'94), pp. 263270, MorganKaufman, 1994.
- Concept Learning and the Problem of Small Disjuncts \Lambda March 31, 1995
- Machine Learning, xx, 1{23 (xxxx) c xxxx Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- Compressing Pattern Databases Ariel Felner and Ram Meshulam
- Exploiting the Cost (In)sensitivity of Decision Tree Splitting Criteria Chris Drummond cdrummon@site.uottawa.ca
- Explicitly Representing Expected Cost: An Alternative to ROC Representation
- Inferring What a User is Not Interested In Robert C. Holte
- Accelerating Browsing by Automatically Inferring a User's Search Goal Chris Drummond Robert Holte Dan Ionescu
- Accelerating Browsing by Automatically Inferring a User's Search Goal Chris Drummond Robert Holte Dan Ionescu
- Learning to Use a Learned Model: A Two-Stage Approach to Classification Maria-Luiza Antonie
- PSVN: A Vector Representation for Production Systems TR9904 1 PSVN: A Vector Representation for Production Systems
- A Learning Agent that Assists the Browsing of Software Libraries \Lambda
- Compressing Pattern Databases Ariel Felner and Ram Meshulam
- The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming Dale Schuurmans and Finnegan Southey
- Experiments with Automatically Created MemoryBased Heuristics
- Effective Short-Term Opponent Exploitation in Simplified Poker
- Semi-Automated Gameplay Analysis by Machine Learning Finnegan Southey, Gang Xiao,
- Teaching Dimensions Based on Cooperative Learning Sandra Zilles1
- Severe Class Imbalance: Why Better Algorithms Aren't the Answer
- Theory and Applications of Agnostic PAC-Learning with Small Decision Trees Institute for Theoretical Computer Science
- Very Simple Classification Rules Perform Well on Most Commonly Used Datasets
- Bootstrap Learning of Heuristic Functions Shahab Jabbari Arfaee
- Searching Without a Heuristic: Efficient Use of Abstraction Bradford Larsen, Ethan Burns, Wheeler Ruml
- A* Search with Inconsistent Heuristics Zhifu Zhang, Nathan R. Sturtevant,
- This article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and
- Journal of Artificial Intelligence Research 30 (2007) 213-247 Submitted 12/06; published 10/07 Compressed Pattern Databases
- Using Infeasibility to Improve Abstraction-Based Heuristics
- Maximizing over Multiple Pattern Databases Speeds up Heuristic Search
- PSVN: A Vector Representation for Production Systems TR-99-04 1 PSVN: A Vector Representation for Production Systems
- Optimal Traffic-Oblivious Energy-Aware Routing For Multihop Wireless Networks
- Impact of Lossy Links on Performance of Multihop Wireless Networks
- The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming Dale Schuurmans and Finnegan Southey
- Searching for Content-based Addresses on the World-Wide Web
- A Learning Agent that Assists the Browsing of Software Libraries
- A Learning Apprentice For Browsing Robert C. Holte Chris Drummond
- Predicting the Performance of IDA* with Conditional Distributions Computer Science
- Hierarchical Heuristic Search Revisited Robert C. Holte, Jeffery Grajkowski, and Brian Tanner
- Cost-sensitive Classifier Evaluation using Cost Curves Robert C. Holte
- Software Testing by Active Learning for Commercial Games Finnegan Southey
- A Simple Method for Balancing Network Utilization and Quality of Routing
- IDA* MCSP: A Fast Exact MCSP Algorithm Yuxi Li Janelle Harms Robert Holte
- Dual Search in Permutation State Spaces Computer Science
- Effective Short-Term Opponent Exploitation in Simplified Poker Finnegan Southey
- The Compression Power of Symbolic Pattern Databases Marcel Ball and Robert Holte
- Automated Action Abstraction of Imperfect Information Extensive-Form Games John Hawkin and Robert Holte and Duane Szafron
- Fringe Search: Beating A* at Pathfinding on Game Maps Yngvi Bjornsson Markus Enzenberger, Robert C. Holte and Jonathan Schaeffer
- Machine Learning for Semi-Automated Gameplay Analysis Finnegan Southey, Robert Holte, Gang Xiao, Mark Trommelen
- Mechanical Generation of Admissible Robert Holte, Jonathan Schaeffer, and Ariel Felner
- Effective Short-Term Opponent Exploitation in Simplified Poker
- Cost-sensitive Classifier Evaluation using Cost Curves Robert C. Holte1
- Empirical analysis of the rank distribution of relevant documents in web search Shen Jiang, Sandra Zilles, and Robert Holte
- Combinatorial Auctions, Knapsack Problems, and Hill-climbing Search
- Dual Lookups in Pattern Databases Ariel Felner
- Approximating Game-Theoretic Optimal Strategies for Full-scale Poker D. Billings, N. Burch, A. Davidson, R. Holte, J. Schaeffer, T. Schauenberg, and D. Szafron
- Concept Learning and the Problem of Small Disjuncts March 31, 1995
- Statistical Science 2006, Vol. 21, No. 1, 2426
- Using Lookaheads with Optimal Best-First Search Roni Stern Tamar Kulberis Ariel Felner
- Hierarchical A*: Searching Abstraction Hierarchies Efficiently R.C. Holte, M.B. Perez, R.M. Zimmer, A.J. MacDonald
- The Tradeoff Between Speed and Optimality in Hierarchical Search
- Query suggestion by query search: a new approach to user support in web search
- published in the Proceedings of the 10th Canadian Conference on Artificial Intelligence (AI'94), pp. 263-270, Morgan-Kaufman, 1994.
- Downward Path Preserving State Space Abstractions Sandra Zilles zilles@cs.ualberta.ca
- Compressing Pattern Databases with Learning Mehdi Samadi1 and Maryam Siabani2 and Ariel Felner 3 and Robert Holte1
- Stable and Robust Multipath Oblivious Routing for Traffic Engineering
- Inferring What a User is Not Interested In Robert C. Holte
- Holte, Mkadmi, Zimmer, MacDonald 1 AI Journal (Revised) Speeding Up Problem Solving by Abstraction
- Journal of Machine Learning Research 12 (2011) 349-384 Submitted 6/10; Revised 12/10; Published 2/11 Models of Cooperative Teaching and Learning
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Sequential and Parallel Algorithms for Frontier A* with Delayed Duplicate Robert Niewiadomski
- Accepted Manuscript Inconsistent heuristics in theory and practice
- Experiments with Automatically Created Memory-Based Heuristics
- Mach Learn (2006) 65:95130 DOI 10.1007/s10994-006-8199-5
- Partial Pattern Databases Kenneth Anderson, Robert Holte, and Jonathan Schaeffer
- Fast Exact MultiConstraint Shortest Path Algorithms Yuxi Li Janelle Harms Robert Holte
- Decision Tree Instability and Active Learning Kenneth Dwyer and Robert Holte
- A Polynomial-time Algorithm for Non-optimal Multi-Agent Pathfinding Mokhtar M. Khorshid
- Probably Approximately Correct Heuristic Search Roni Stern Ariel Felner
- Improved Prediction of IDA*'s Performance via -Truncation Department of Computing Science
- State-Set Search Bo Pang and Robert C. Holte
- Automatic Move Pruning in General Single-Player Games Computing Science Department
- Does Representation Matter in the Planning Competition? Patricia J. Riddle
- Faster Optimal and Suboptimal Hierarchical Search Michael J. Leighton and Wheeler Ruml
- (This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached
- (This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached
