Author:
Mitavskiy Boris S.,Tuci Elio,Cannings Chris,Rowe Jonathan,He Jun
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications
Reference25 articles.
1. Agrawal R (1995) Sample mean based index policies with o (logn) regret for the multi-armed bandit problem. Adv Appl Probab 27:1054–1078
2. Auer P (2002) Using confidence bounds for exploration–exploitation trade-offs. J Mach Learn Res 3:397–422
3. Auger A, Doerr B (2011) Theory of randomized search heuristics. Series on theoretical computer science. Elsevier, Amsterdam
4. Barr M, Wells C (1998) Category theory for computing science. Prentice Hall, Upper Saddle River
5. Ehresmann A, Smeonov P (2012) Wlimes: towards a theoretical framework for wandering logic intelligence memory evolutive systems. In: Simeonov PL, Smith LS, Ehresmann AC (eds) Integral biomathics: tracing the road to reality. Springer, Heidelberg