Switch to: References

Add citations

You must login to add citations.
  1. Learning in mathematically-based domains: Understanding and generalizing obstacle cancellations.Jude W. Shavlik & Gerald F. DeJong - 1990 - Artificial Intelligence 45 (1-2):1-45.
    Download  
     
    Export citation  
     
    Bookmark  
  • Towards a computer model of memory search strategy learning.David Leake - 1994 - In Ashwin Ram & Kurt Eiselt (eds.), Proceedings of the Sixteenth Annual Conference of the Cognitive Science Society: August 13 to 16, 1994, Georgia Institute of Technology. Erlbaum. pp. 549--554.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Learning to improve constraint-based scheduling.Monte Zweben, Eugene Davis, Brian Daun, Ellen Drascher, Michael Deale & Megan Eskey - 1992 - Artificial Intelligence 58 (1-3):271-296.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Design by derivational analogy:Issues in the automated replay of design plans.Jack Mostow - 1989 - Artificial Intelligence 40 (1-3):119-184.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-c4c498947-zxqrr uwo