A dynamic programming strategy to balance exploration and exploitation in the bandit problem

Author： Caelen Olivier   Bontempi Gianluca  

Publisher： Springer Publishing Company

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.60, Iss.1-2, 2010-10, pp. : 3-24

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A DYNAMIC PROGRAMMING ALGORITHM TO TEST A SIGNED GRAPH FOR BALANCE

By LOUKAKIS E.  

International Journal of Computer Mathematics, Vol. 80, Iss. 4, 2003-04 ,pp. : 499-507

Taylor & Francis Ltd

Access to resources Recommend Favorite

Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem

By Kellerer Hans   Pferschy Ulrich  

Journal of Combinatorial Optimization, Vol. 8, Iss. 1, 2004-03 ,pp. : 5-11

Springer Publishing Company

Access to resources Recommend Favorite

Solving the Top-percentile traffic routing problem by Approximate Dynamic Programming

By Yang Xinan   Grothey Andreas  

IMA Journal of Management Mathematics, Vol. 23, Iss. 4, 2012-10 ,pp. : 413-434

Oxford University Press

Access to resources Recommend Favorite

Dynamic programming approaches to solve the shortest path problem with forbidden paths

By Di Puglia Pugliese Luigi   Guerriero Francesca  

Optimization Methods and Software, Vol. 28, Iss. 2, 2013-04 ,pp. : 221-255

Taylor & Francis Ltd

Access to resources Recommend Favorite

Exploration and Exploitation of Water in Colloidal Crystals

By  

ADVANCED MATERIALS, Vol. 27, Iss. 17, 2015-05 ,pp. : 2686-2714

John Wiley & Sons Inc

Access to resources Recommend Favorite