1![Regret Analysis of the Anytime Optimally Confident UCB Algorithm Tor Lattimore Department of Computing Science University of Alberta, Canada Regret Analysis of the Anytime Optimally Confident UCB Algorithm Tor Lattimore Department of Computing Science University of Alberta, Canada](https://www.pdfsearch.io/img/15a26c05ce905a71b69547d2e729824c.jpg) | Add to Reading ListSource URL: downloads.tor-lattimore.com- Date: 2016-05-20 03:01:37
|
---|
2![Deterministic Anytime Inference for Stochastic Continuous-Time Markov Processes E. Busra Celikkaya University of California, Riverside CELIKKAE @ CS . UCR . EDU Deterministic Anytime Inference for Stochastic Continuous-Time Markov Processes E. Busra Celikkaya University of California, Riverside CELIKKAE @ CS . UCR . EDU](https://www.pdfsearch.io/img/3e75c97df680804edd5d07c4c3ef19a1.jpg) | Add to Reading ListSource URL: rlair.cs.ucr.eduLanguage: English - Date: 2015-05-14 15:50:46
|
---|
3![Genome Informatics 12: 73–A Multi-Queue Branch-and-Bound Algorithm for Anytime Optimal Search Genome Informatics 12: 73–A Multi-Queue Branch-and-Bound Algorithm for Anytime Optimal Search](https://www.pdfsearch.io/img/258c525d7acb785fc04c04692876f90b.jpg) | Add to Reading ListSource URL: www.jsbi.orgLanguage: English - Date: 2002-01-17 03:51:05
|
---|
4![A Distributed Anytime Algorithm for Dynamic Task Allocation in Multi-Agent Systems Kathryn S. Macarthur, Ruben Stranders, Sarvapali D. Ramchurn and Nicholas R. Jennings {ksm08r,rs2,sdr,nrj}@ecs.soton.ac.uk School of Elec A Distributed Anytime Algorithm for Dynamic Task Allocation in Multi-Agent Systems Kathryn S. Macarthur, Ruben Stranders, Sarvapali D. Ramchurn and Nicholas R. Jennings {ksm08r,rs2,sdr,nrj}@ecs.soton.ac.uk School of Elec](https://www.pdfsearch.io/img/fefe6b0f2b10a2d267e5a4faf19a39c6.jpg) | Add to Reading ListSource URL: www.orchid.ac.ukLanguage: English - Date: 2011-08-10 05:53:15
|
---|
5![A Complete Anytime Algorithm for Treewidth Vibhav Gogate and Rina Dechter School of Information and Computer Science, University of California, Irvine, CA 92967 {vgogate,dechter}@ics.uci.edu A Complete Anytime Algorithm for Treewidth Vibhav Gogate and Rina Dechter School of Information and Computer Science, University of California, Irvine, CA 92967 {vgogate,dechter}@ics.uci.edu](https://www.pdfsearch.io/img/9262d027f2f113bae6887d48fcc9daf0.jpg) | Add to Reading ListSource URL: www.hlt.utdallas.eduLanguage: English - Date: 2011-09-26 17:58:56
|
---|
6![Anytime Behaviour of Mixed CSP Solving Neil Yorke-Smith and Christophe Guettier IC–Parc, Imperial College London, SW7 2AZ, U.K. fnys, Abstract An algorithm with the anytime property has an approxi Anytime Behaviour of Mixed CSP Solving Neil Yorke-Smith and Christophe Guettier IC–Parc, Imperial College London, SW7 2AZ, U.K. fnys, Abstract An algorithm with the anytime property has an approxi](https://www.pdfsearch.io/img/d97c317313febe2c2e83041d4af679d1.jpg) | Add to Reading ListSource URL: www.cri.ensmp.frLanguage: English - Date: 2007-12-13 09:57:36
|
---|
7![Anytime Motion Planning using the RRT∗ Sertac Karaman Matthew R. Walter Alejandro Perez Anytime Motion Planning using the RRT∗ Sertac Karaman Matthew R. Walter Alejandro Perez](https://www.pdfsearch.io/img/7eed68770f6e2fe317dcae480b7e601b.jpg) | Add to Reading ListSource URL: ttic.uchicago.eduLanguage: English - Date: 2014-11-19 14:27:00
|
---|
8![Anytime Incremental Planning with E-Graphs Mike Phillips1 and Andrew Dornbush1 and Sachin Chitta2 and Maxim Likhachev1 Abstract— Robots operating in real world environments need to find motion plans quickly. Robot moti Anytime Incremental Planning with E-Graphs Mike Phillips1 and Andrew Dornbush1 and Sachin Chitta2 and Maxim Likhachev1 Abstract— Robots operating in real world environments need to find motion plans quickly. Robot moti](https://www.pdfsearch.io/img/e57a3d358ec26cd9bc5e33d7ee4c5fd5.jpg) | Add to Reading ListSource URL: www.cs.cmu.eduLanguage: English - Date: 2013-02-26 12:06:48
|
---|
9![Anytime Search-Based Footstep Planning with Suboptimality Bounds Armin Hornung Andrew Dornbush Anytime Search-Based Footstep Planning with Suboptimality Bounds Armin Hornung Andrew Dornbush](https://www.pdfsearch.io/img/890b8cf961c5dccb9e5afff82b3c106a.jpg) | Add to Reading ListSource URL: hrl.informatik.uni-freiburg.deLanguage: English - Date: 2013-01-08 04:27:51
|
---|
10![Journal of Artificial Intelligence Research–567 Submitted 09/08; publishedAn Anytime Algorithm for Optimal Coalition Structure Generation Talal Rahwan Journal of Artificial Intelligence Research–567 Submitted 09/08; publishedAn Anytime Algorithm for Optimal Coalition Structure Generation Talal Rahwan](https://www.pdfsearch.io/img/18421a138e00917d33d6b3387b4b7fb6.jpg) | Add to Reading ListSource URL: jair.orgLanguage: English - Date: 2009-04-21 14:18:39
|
---|