• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Optimal Ordered Problem Solver (2002)

Cached

  • Download as a PDF

Download Links

  • [ftp.idsia.ch]
  • [www.idsia.ch]
  • [ftp.idsia.ch]
  • [www.denizyuret.com]
  • [www2.denizyuret.com]
  • [www.cs.bham.ac.uk]
  • [www6.in.tum.de]
  • [www6.in.tum.de]
  • [www.unibuc.ro]
  • [www.cs.bham.ac.uk]
  • [arxiv.org]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Jürgen Schmidhuber
Citations:70 - 21 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Schmidhuber02optimalordered,
    author = {Jürgen Schmidhuber},
    title = {Optimal Ordered Problem Solver},
    year = {2002}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We present a novel, general, optimally fast, incremental way of searching for a universal algorithm that solves each task in a sequence of tasks. The Optimal Ordered Problem Solver (OOPS) continually organizes and exploits previously found solutions to earlier tasks, eciently searching not only the space of domain-specific algorithms, but also the space of search algorithms. Essentially we extend the principles of optimal nonincremental universal search to build an incremental universal learner that is able to improve itself through experience.

Keyphrases

optimal ordered problem solver    incremental universal learner    incremental way    domain-specific algorithm    universal algorithm    search algorithm    optimal nonincremental universal search   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University