Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Books Books
" Generally speaking, a successful division will reduce the search time not by a mere fraction, but by a. fractional exponent. In a graph with 10 branches descending from each node, a 20-step search might involve 1020 trials, which is out of the question,... "
Machine Intelligence and Robotics: Report of the NASA Study Group : Final Report - Page 442
by NASA Study Group on Machine Intelligence and Robotics - 1980 - 400 pages
Full view - About this book

Artificial Intelligence: Critical Concepts, Volume 2

Ronald Chrisley, Sander Begeer - Artificial intelligence - 2000 - 586 pages
...node, a 20-step search might involve 1020 trials, which is out of the question, while the insertion of just four lemmas or sequential subgoals might reduce the search to only 5. 104 trials, which is within reason for machine exploration. Thus it will be worth a relatively enormous...
Limited preview - About this book




  1. My library
  2. Help
  3. Advanced Book Search
  4. Download EPUB
  5. Download PDF