Using genetic programming to learn and improve control knowledge
Artificial Intelligence
Nagging: a scalable fault-tolerant paradigm for distributed search
Artificial Intelligence
Speedup learning for repair-based search by identifying redundant steps
The Journal of Machine Learning Research
An optimal multiprocessor combinatorial auction solver
Computers and Operations Research
Adaptive problem-solving for large-scale scheduling problems: a case study
Journal of Artificial Intelligence Research
A selective macro-learning algorithm and its application to the N × N sliding-tile puzzle
Journal of Artificial Intelligence Research
Concept formation over explanations and problem-solving experience
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
Integrating abstraction and explanation-based learning in PRODIGY
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2
A statistical approach to solving the EBL utility problem
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Relative utility of EBG based plan reuse in partial ordering vs. total ordering planning
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Building Mashups by Demonstration
ACM Transactions on the Web (TWEB)
Tradeoffs in the empirical evaluation of competing algorithm designs
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
A number of experimental evaluations of explanation-based learning (EBL) have been reported in the literature on machine learning. A close examination of the design of these experiments reveals certain methodological problems that could affect the conclusions drawn from the experiments. This article analyzes some of the more common methodological difficulties, and illustrates them using selected previous studies.