1. Learning Nonoverlapping Perceptron Networks from Examples and Membership Queries

   • Thomas R. Hancock
   • Mostefa Golea
   • Mario Marchand

   OriginalPaper Pages: 161 - 183

2. Learning nonoverlapping perceptron networks from examples and membership queries

   • Thomas R. Hancock
   • Mostefa Golea
   • Mario Marchand

   OriginalPaper Pages: 161 - 183

3. Asynchronous Stochastic Approximation and Q-Learning

   • John N. Tsitsiklis

   OriginalPaper Pages: 185 - 202

4. Asynchronous stochastic approximation and Q-learning

   • John N. Tsitsiklis

   OriginalPaper Pages: 185 - 202

5. Complexity–Based Induction

   • Darrell Conklin
   • Ian H. Witten

   OriginalPaper Pages: 203 - 225

6. Complexity-based induction

   • Darrell Conklin
   • Ian H. Witten

   OriginalPaper Pages: 203 - 225

7. An Upper Bound on the Loss from Approximate Optimal-Value Functions

   • Satinder P. Singh
   • Richard C. Yee

   OriginalPaper Pages: 227 - 233

8. An upper bound on the loss from approximate optimal-value functions

   • Satinder P. Singh
   • Richard C. Yee

   Technical Note Pages: 227 - 233

9. Book Review: C4.5: Programs for Machine Learning by J. Ross Quinlan. Morgan Kaufmann Publishers, Inc., 1993

   • Steven L. Salzberg

   BookReview Pages: 235 - 240

10. C4.5: Programs for Machine Learning by J. Ross Quinlan. Morgan Kaufmann Publishers, Inc., 1993

    • Steven L. Salzberg

    Book Review Pages: 235 - 240