Content deleted Content added
No edit summary |
starting a list of "famous" anytime algorithms |
||
Line 31:
*Growth rate: Amount of increase with each step. Does it change constantly, such as in a [[bubble sort]] or does it change unpredictably?
*End condition: The amount of runtime needed<ref name="Teije"/>
== Examples ==
There are many famous anytime algorithms in the literature. We list here some of them.
* PBVI (point-based value iteration) is an anytime algorithm for [[Automated planning and scheduling|automated planning]] in [[Partially observable Markov decision process|partially observable Markov decision processes]]<ref>{{Cite journal |last=Pineau |first=Joelle |last2=Gordon |first2=Geoff |last3=Thrun |first3=Sebastian |date=2003-08-09 |title=Point-based value iteration: an anytime algorithm for POMDPs |url=https://dl.acm.org/doi/10.5555/1630659.1630806 |journal=Proceedings of the 18th international joint conference on Artificial intelligence |series=IJCAI'03 |___location=San Francisco, CA, USA |publisher=Morgan Kaufmann Publishers Inc. |pages=1025–1030 |doi=10.5555/1630659.1630806}}</ref>.
==References==
| |||