Content deleted Content added
Kenji Toyama (talk | contribs) m Remove definite article. |
No edit summary |
||
Line 13:
Anytime algorithms are designed so that it can be told to stop at any time and would return the best result it has found so far.<ref name="Grass"/> This is why it is called an interruptible algorithm. Anytime algorithms also maintain the last result, so that if they are given more time, they can continue from where they left off to obtain an even better result.<ref name="Grass"/>
An interesting corollary of the anytime paradigm is that the algorithm
will automatically yield a better response for a fixed computing time frame as processor power increases due to technological advances. In the same amount of real-world time, e.g., the search depth can be deeper, increasing the likelihood of returning better results. Fixed-condition terminating algorithms, on the other hand, would give exactly the same response as before, but faster, not better.
== Decision trees ==
| |||