Robert C. Holte

According to our database1, Robert C. Holte authored at least 139 papers between 1989 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
MS-Lite: A Lightweight, Complementary Merge-and-Shrink Method.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

2017
MM: A bidirectional search algorithm that is guaranteed to meet in the middle.
Artif. Intell., 2017

Additive Merge-and-Shrink Heuristics for Diverse Action Costs.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

The Two-Edged Nature of Diverse Action Costs.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Sufficient Conditions for Node Expansion in Bidirectional Heuristic Search.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

2016
Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces.
Artif. Intell., 2016

Extended Abstract: An Improved Priority Function for Bidirectional Heuristic Search.
Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Redundancy reduction: does it help associative classifiers?
Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016

Improved Heuristic and Tie-Breaking for Optimally Solving Sokoban.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Heuristic Subset Selection in Classical Planning.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Action Selection for Hammer Shots in Curling.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Bidirectional Search That Is Guaranteed to Meet in the Middle.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
The Spurious Path Problem in Abstraction.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Understanding and Improving Local Exploration for GBFS.
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

A Generalization of Sleep Sets Based on Operator Sequence Redundancy.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Enhanced Partial Expansion A.
J. Artif. Intell. Res., 2014

Predicting optimal solution cost with conditional probabilities - Predicting optimal solution cost.
Ann. Math. Artif. Intell., 2014

Automatic move pruning for single-agent search.
AI Commun., 2014

Non-Linear Merging Strategies for Merge-and-Shrink Based on Variable Interactions.
Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

A* with Lookahead Re-Evaluated.
Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

A Comparison of h 2 and MMM for Mutex Pair Detection Applied to Pattern Databases.
Proceedings of the Advances in Artificial Intelligence, 2014

Type-Based Exploration with Multiple Search Queues for Satisficing Planning.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Adding Local Exploration to Greedy Best-First Search in Satisficing Planning.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Predicting the size of IDA*'s search tree.
Artif. Intell., 2013

Optimal-Generation Variants of EPEA.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Using Coarse State Space Abstractions to Detect Mutex Pairs.
Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, 2013

Korf's Conjecture and the Future of Abstraction-Based Heuristics.
Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, 2013

Detecting Mutex Pairs in State Spaces by Sampling.
Proceedings of the AI 2013: Advances in Artificial Intelligence, 2013

Stratified tree search: a novel suboptimal heuristic search algorithm.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Move Pruning and Duplicate Detection.
Proceedings of the Advances in Artificial Intelligence, 2013

2012
Search-Aware Conditions for Probably Approximately Correct Heuristic Search.
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Multimapping Abstractions and Hierarchical Heuristic Search.
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Predicting Optimal Solution Cost with Bidirectional Stratified Sampling (Abstract).
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Learning Heuristic Functions Faster by Using Predicted Solution Costs.
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Partial-Expansion A* with Selective Node Generation.
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Automatic Move Pruning Revisited.
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Improved Query Suggestion by Query Search.
Proceedings of the KI 2012: Advances in Artificial Intelligence, 2012

PAC-Learning with General Class Noise Models.
Proceedings of the KI 2012: Advances in Artificial Intelligence, 2012

Predicting Optimal Solution Cost with Bidirectional Stratified Sampling.
Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

Fast and Accurate Predictions of IDA*'s Performance.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

Using Sliding Windows to Generate Action Abstractions in Extensive-Form Games.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

Partial-Expansion A* with Selective Node Generation.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Models of Cooperative Teaching and Learning.
Journal of Machine Learning Research, 2011

Inconsistent heuristics in theory and practice.
Artif. Intell., 2011

Learning heuristic functions for large state spaces.
Artif. Intell., 2011

Abstract: Block A* and Any-Angle Path-Planning.
Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Probably Approximately Correct Heuristic Search.
Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

State-Set Search.
Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Improved Prediction of IDA*'s Performance via Epsilon-Truncation.
Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Faster Optimal and Suboptimal Hierarchical Search.
Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding.
Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Automatic Move Pruning in General Single-Player Games.
Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Does Representation Matter in the Planning Competition?
Proceedings of the Ninth Symposium on Abstraction, Reformulation, and Approximation, 2011

Invited Talk Abstracts.
Proceedings of the Twenty-Fourth International Florida Artificial Intelligence Research Society Conference, 2011

Any-Angle Path Planning for Computer Games.
Proceedings of the Seventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2011

Block A*: Database-Driven Search with Applications in Any-Angle Path-Planning.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

Time Complexity of Iterative-Deepening A*: The Informativeness Pathology (Abstract).
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

Automated Action Abstraction of Imperfect Information Extensive-Form Games.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Predicting the Performance of IDA* using Conditional Distributions.
J. Artif. Intell. Res., 2010

The computational complexity of avoiding spurious states in state space abstraction.
Artif. Intell., 2010

Common Misconceptions Concerning Heuristic Search.
Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

Bootstrap Learning of Heuristic Functions.
Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

Automating Layouts of Sewers in Subdivisions.
Proceedings of the ECAI 2010, 2010

Using Lookaheads with Optimal Best-First Search.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Searching Without a Heuristic: Efficient Use of Abstraction.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Effective short-term opponent exploitation in simplified poker.
Machine Learning, 2009

Query Suggestion by Query Search: A New Approach to User Support in Web Search.
Proceedings of the 2009 IEEE/WIC/ACM International Conference on Web Intelligence, 2009

Downward Path Preserving State Space Abstractions (Extended Abstract).
Proceedings of the Eighth Symposium on Abstraction, Reformulation, and Approximation, 2009

A* Search with Inconsistent Heuristics.
Proceedings of the IJCAI 2009, 2009

A demonstration of the Polaris poker system.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008
A General Theory of Additive State Space Abstractions.
J. Artif. Intell. Res., 2008

Duality in permutation state spaces and the dual search algorithm.
Artif. Intell., 2008

Empirical Analysis of the Rank Distribution of Relevant Documents in Web Search.
Proceedings of the 2008 IEEE / WIC / ACM International Conference on Web Intelligence, 2008

Cost-Sensitive Classifier Evaluation Using Cost Curves.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2008

Compressing Pattern Databases with Learning.
Proceedings of the ECAI 2008, 2008

Teaching Dimensions based on Cooperative Learning.
Proceedings of the 21st Annual Conference on Learning Theory, 2008

The Compression Power of Symbolic Pattern Databases.
Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

Predicting the Performance of IDA* with Conditional Distributions.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Compressed Pattern Databases.
J. Artif. Intell. Res., 2007

Stable and Robust Multipath Oblivious Routing for Traffic Engineering.
Proceedings of the Managing Traffic Performance in Converged Networks, 2007

Using Infeasibility to Improve Abstraction-Based Heuristics.
Proceedings of the Abstraction, 2007

Partial Pattern Databases.
Proceedings of the Abstraction, 2007

Fast Exact MultiConstraint Shortest Path Algorithms.
Proceedings of IEEE International Conference on Communications, 2007

Decision Tree Instability and Active Learning.
Proceedings of the Machine Learning: ECML 2007, 2007

2006
Cost curves: An improved method for visualizing classifier performance.
Machine Learning, 2006

Reports on the Twenty-First National Conference on Artificial Intelligence (AAAI-06) Workshop Program.
AI Magazine, 2006

Maximizing over multiple pattern databases speeds up heuristic search.
Artif. Intell., 2006

Optimal Traffic-Oblivious Energy-Aware Routing for Multihop Wireless Networks.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

A Parallel External-Memory Frontier Breadth-First Traversal Algorithm for Clusters of Workstations.
Proceedings of the 2006 International Conference on Parallel Processing (ICPP 2006), 2006

Learning to Use a Learned Model: A Two-Stage Approach to Classification.
Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 2006

Dual Search in Permutation State Spaces.
Proceedings of the Proceedings, 2006

Sequential and Parallel Algorithms for Frontier A* with Delayed Duplicate Detection.
Proceedings of the Proceedings, 2006

2005
Hierarchical Heuristic Search Revisited.
Proceedings of the Abstraction, 2005

Dual Lookups in Pattern Databases.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Impact of lossy links on performance of multihop wireless networks.
Proceedings of the 14th International Conference On Computer Communications and Networks, 2005

A simple method for balancing network utilization and quality of routing.
Proceedings of the 14th International Conference On Computer Communications and Networks, 2005

IDA*_MCSP: a fast exact MCSP algorithm.
Proceedings of IEEE International Conference on Communications, 2005

Severe Class Imbalance: Why Better Algorithms Aren't the Answer.
Proceedings of the Machine Learning: ECML 2005, 2005

Fringe Search: Beating A* at Pathfinding on Game Maps.
Proceedings of the 2005 IEEE Symposium on Computational Intelligence and Games (CIG05), 2005

Semi-Automated Gameplay Analysis by Machine Learning.
Proceedings of the First Artificial Intelligence and Interactive Digital Entertainment Conference, 2005

Software Testing by Active Learning for Commercial Games.
Proceedings of the Proceedings, 2005

SAGA-ML: An Active Learning System for Semiautomated Gameplay Analysis.
Proceedings of the Proceedings, 2005

Effective Short-Term Opponent Exploitation in Simplified Poker.
Proceedings of the Proceedings, 2005

2004
Introduction: Lessons Learned from Data Mining Applications and Collaborative Problem Solving.
Machine Learning, 2004

A performance study of data layout techniques for improving data locality in refinement-based pathfinding.
ACM Journal of Experimental Algorithmics, 2004

What ROC Curves Can't Do (and Cost Curves Can).
Proceedings of the ROC Analysis in Artificial Intelligence, 1st International Workshop, 2004

Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games.
Proceedings of the Computers and Games, 4th International Conference, 2004

Multiple Pattern Databases.
Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), 2004

Compressing Pattern Databases.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003
The Fifth Symposium on Abstraction, Reformulation, and Approximation (SARA-2002).
AI Magazine, 2003

Comparison of Different Grid Abstractions for Pathfinding on Maps.
Proceedings of the IJCAI-03, 2003

Approximating Game-Theoretic Optimal Strategies for Full-scale Poker.
Proceedings of the IJCAI-03, 2003

Crafting Data Structures: A Study of Reference Locality in Refinement-Based Pathfinding.
Proceedings of the High Performance Computing - HiPC 2003, 10th International Conference, 2003

2001
AAAI 2000 Workshop Reports.
AI Magazine, 2001

The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

Combinatorial Auctions, Knapsack Problems, and Hill-Climbing Search.
Proceedings of the Advances in Artificial Intelligence, 2001

2000
A Learning Agent that Assists the Browsing of Software Libraries.
IEEE Trans. Software Eng., 2000

Experiments with Automatically Created Memory-Based Heuristics.
Proceedings of the Abstraction, 2000

Explicitly representing expected cost: an alternative to ROC representation.
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, 2000

Exploiting the Cost (In)sensitivity of Decision Tree Splitting Criteria.
Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000), Stanford University, Stanford, CA, USA, June 29, 2000

1999
A Space-Time Tradeoff for Memory-Based Heuristics.
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

1998
Machine Learning for the Detection of Oil Spills in Satellite Radar Images.
Machine Learning, 1998

Searching for Content-Based Addresses on the World-Wide Web.
Proceedings of the 3rd ACM International Conference on Digital Libraries, 1998

1997
The Impact of Representation on the Efficacy of Artificial Intelligence: The Case of Genetic Algorithms.
AI Soc., 1997

Learning When Negative Examples Abound.
Proceedings of the Machine Learning: ECML-97, 1997

1996
Speeding up Problem Solving by Abstraction: A Graph Oriented Approach.
Artif. Intell., 1996

Intelligent Browsing for Multimedia Applications.
Proceedings of the IEEE International Conference on Multimedia Computing and Systems, 1996

Inferring What a User Is Not Interested in.
Proceedings of the Advances in Artificial Intelligence, 1996

Hierarchical A*: Searching Abstraction Hierarchies Efficiently.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995
Theory and Applications of Agnostic PAC-Learning with Small Decision Trees.
Proceedings of the Machine Learning, 1995

1993
Very Simple Classification Rules Perform Well on Most Commonly Used Datasets.
Machine Learning, 1993

Accelerating browsing by automatically inferring a user's search goal.
Proceedings of the Eighth Knowledge-Based Software Engineering Conference, 1993

1992
Pinwheel Scheduling with Two Distinct Numbers.
Theor. Comput. Sci., 1992

Lazy Partial Evaluation: An Integration of Explanation-Based Generalization and Partial Evaluation.
Proceedings of the Ninth International Workshop on Machine Learning (ML 1992), 1992

1990
Concept Learning and Heuristic Classification in WeakTtheory Domains.
Artif. Intell., 1990

1989
Pinwheel Scheduling With Tow Distinct Numbers.
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

Concept Learning and the Problem of Small Disjuncts.
Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

A Mathematical Framework for Studying Representation.
Proceedings of the Sixth International Workshop on Machine Learning (ML 1989), 1989


  Loading...