116 search results - page 17 / 24 » Bounds for online bounded space hypercube packing |
117
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
SODA
1998
ACM
14 years 10 months ago
1998
ACM
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— Research on numerical solution methods for partially observable Markov decision processes (POMDPs) has primarily focused on discrete-state models, and these algorithms ...
EDBT
2010
ACM
15 years 4 months ago
2010
ACM
This paper addresses a fundamental and challenging problem with broad applications: efficient processing of region-based promotion queries, i.e., to discover the top-k most inter...
TKDE
2002
14 years 9 months ago
2002
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...