Edited, memorised or added to reading queue

on 26-Sep-2019 (Thu)

Do you want BuboFlash to help you learning these things? Click here to log in or create user.

Flashcard 4409513086220

Define \(\epsilon\)-optimality of a search algorithm.
Definition 6.1. ( \(\epsilon\)-Optimality) A search algorithm is \(\epsilon\)-optimal if it terminates with a solution of maximum cost (1 + \(\epsilon\)) ·δ(s,T), with \(\epsilon\) denoting an arbitrary small positive constant (s is the starting state, T is a goal state).

statusnot learnedmeasured difficulty37% [default]last interval [days]               
repetition number in this series0memorised on               scheduled repetition               
scheduled repetition interval               last repetition or drill


cannot see any pdfs