Revision as of 10:26, 27 January 2025 edit Fschwarzentruber (talk \| contribs) 232 edits starting a list of "famous" anytime algorithms Tag: Visual edit ← Previous edit		Revision as of 21:35, 27 January 2025 edit undo Citation bot (talk \| contribs) Bots 5,861,331 edits Altered journal. Add: authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. \| Use this bot. Report bugs. \| Suggested by Jay8g \| Category:CS1 errors: DOI \| #UCB_Category 2/4 Next edit →
Line 35: 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~~last1=Pineau \|~~first~~first1=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~~International ~~joint~~Joint ~~conference~~Conference on Artificial ~~intelligence~~Intelligence \|series=IJCAI'03 \|___location=San Francisco, CA, USA \|publisher=Morgan Kaufmann Publishers Inc. \|pages=1025–1030 ~~\|doi=10.5555/1630659.1630806~~}}</ref>. ==References==

Anytime algorithm: Difference between revisions