World's Best Scientists 2026 revealed!
Robert C. Holte

Robert C. Holte

D-Index & Metrics

Computer Science

D-Index
47
Citations
13609
World Ranking
6336
National Ranking
254

Research.com Recognitions

  • 2011 - Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) For significant contributions to the science and practice of empirical machine learning, and for leadership of the Machine Learning Journal.

Overview

Robert C. Holte is affiliated with the University of Alberta in Canada and has contributed extensively to the field of computer science, particularly within artificial intelligence. Their work encompasses various subfields including artificial intelligence, computer networks and communications, computer vision and pattern recognition, economics and econometrics, and management science and operations research.

The scientist's primary research interests include AI-based problem solving and planning, constraint satisfaction and optimization, machine learning and algorithms, metaheuristic optimization algorithms research, robotic path planning algorithms, logic, reasoning, and knowledge, as well as advanced database systems and queries.

Frequent co-authors of Robert C. Holte include Ariel Felner, Roni Stern, Nathan Sturtevant, Jonathan Schaeffer, and Wheeler Ruml.

Some examples of recent papers authored or co-authored by the scientist are:

  • A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding, 2021, Proceedings of the International Symposium on Combinatorial Search
  • Partial-Expansion A* with Selective Node Generation, 2021, Proceedings of the AAAI Conference on Artificial Intelligence
  • Partial-Expansion A* with Selective Node Generation, 2021, Proceedings of the International Symposium on Combinatorial Search
  • Using Sliding Windows to Generate Action Abstractions in Extensive-Form Games, 2021, Proceedings of the AAAI Conference on Artificial Intelligence
  • Optimal-Generation Variants of EPEA*, 2021, Proceedings of the International Symposium on Combinatorial Search

The scientist frequently publishes in these venues:

  • Proceedings of the International Symposium on Combinatorial Search
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • arXiv (Cornell University)
  • Proceedings of the International Conference on Automated Planning and Scheduling

Robert C. Holte's work mainly falls under the broad field of computer science with a specific focus on artificial intelligence and associated technical areas.

In recognition of contributions to the field, Robert C. Holte was named a Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) in 2011 for significant contributions to empirical machine learning and leadership related to the Machine Learning Journal.

Best Publications

  • Very Simple Classification Rules Perform Well on Most Commonly Used Datasets

    Robert C. Holte

  • Machine Learning for the Detection of Oil Spills in Satellite Radar Images

    Miroslav Kubat;Robert C. Holte;Stan Matwin

  • C4.5, Class Imbalance, and Cost Sensitivity: Why Under-Sampling beats Over-Sampling

    Chris Drummond;Robert C. Holte

  • Concept learning and the problem of small disjuncts

    Robert C. Holte;Liane E. Acker;Bruce W. Porter

  • The Ninja architecture for robust Internet-scale systems and services373423

    Steven D. Gribble;Matt Welsh;Rob von Behren;Eric A. Brewer

  • Concept learning and heuristic classification in weak-theory domains

    Bruce W. Porter;Ray Bareiss;Robert C. Holte

  • Cost curves: An improved method for visualizing classifier performance

    Chris Drummond;Robert C. Holte

  • Learning When Negative Examples Abound

    Miroslav Kubat;Robert Holte;Stan Matwin

  • Approximating game-theoretic optimal strategies for full-scale poker

    D. Billings;N. Burch;A. Davidson;R. Holte

  • Exploiting the Cost (In)sensitivity of Decision Tree Splitting Criteria

    Chris Drummond;Robert C. Holte

  • Explicitly representing expected cost: an alternative to ROC representation

    Chris Drummond;Robert C. Holte

  • Hierarchical A *: searching abstraction hierarchies efficiently

    Robert C. Holte;M. B. Perez;R. M. Zimmer;A. J. MacDonald

  • The pinwheel: a real-time scheduling problem

    R. Holte;A. Mok;L. Rosier;I. Tulchinsky

  • Enhanced partial expansion A

    Meir Goldenberg;Ariel Felner;Roni Stern;Guni Sharon

  • Theory and applications of agnostic PAC-learning with small decision trees

    Peter Auer;Robert C. Holte;Wolfgang Maass

  • Speeding up problem solving by abstraction: a graph oriented approach

    R. C. Holte;T. Mkadmi;R. M. Zimmer;A. J. MacDonald

  • The exponentiated subgradient algorithm for heuristic Boolean programming

    Dale Schuurmans;Finnegan Southey;Robert C. Holte

  • Game-Tree search with adaptation in stochastic imperfect-information games

    Darse Billings;Aaron Davidson;Terence Schauenberg;Neil Burch

  • Learning heuristic functions for large state spaces

    Shahab Jabbari Arfaee;Sandra Zilles;Robert C. Holte

  • Fringe Search: Beating A* at Pathfinding on Game Maps.

    Yngvi Björnsson;Markus Enzenberger;Robert C. Holte;Jonathan Schaeffer

  • A* search with inconsistent heuristics

    Zhifu Zhang;Nathan R. Sturtevant;Robert Holte;Jonathan Schaeffer

Frequent Co-Authors

Ariel Felner
Ariel Felner Ben-Gurion University of the Negev
Jonathan Schaeffer
Jonathan Schaeffer University of Alberta
Neil Burch
Neil Burch University of Alberta
Nathan R. Sturtevant
Nathan R. Sturtevant University of Alberta
Duane Szafron
Duane Szafron University of Alberta
Michael Bowling
Michael Bowling University of Alberta
Sven Koenig
Sven Koenig University of Southern California
Frank Hutter
Frank Hutter University of Freiburg
Richard E. Korf
Richard E. Korf University of California, Los Angeles
Gary F. Marcus
Gary F. Marcus New York University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens up a wealth of online learning and career advancement opportunities. Aspiring professionals can accelerate their entry into the tech job market with an associate degree in 6 months online, offering a fast and flexible path to foundational knowledge and skills.

For those considering advanced credentials, there are several affordable online masters programs that balance cost with curriculum quality. These programs cater to working adults and recent graduates looking to specialize or transition into leadership roles.

Pursuing doctoral studies is another viable pathway. Options such as the doctorate organizational leadership and the cheapest online edd programs no gre provide affordable routes to expertise in leadership, education, and administration—skills increasingly sought after in tech and academic environments.

Whether your goal is early workforce entry, specialization, or leadership, these online degrees offer flexible and cost-effective options to support your career growth in Computer Science and beyond.

Best Scientists Citing Robert C. Holte

Trending Scientists

Recently Published Articles