Sciweavers

188 search results - page 5 / 38
» Finding Best k Policies
Sort
View
DAWAK
2007
Springer
14 years 2 months ago
Mining Top-K Multidimensional Gradients
Several business applications such as marketing basket analysis, clickstream analysis, fraud detection and churning migration analysis demand gradient data analysis. By employing g...
Ronnie Alves, Orlando Belo, Joel Ribeiro
CORR
2010
Springer
187views Education» more  CORR 2010»
13 years 8 months ago
Learning in A Changing World: Non-Bayesian Restless Multi-Armed Bandit
We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. In this problem, at each time, a player chooses K out of N (N > K) arms to play. The state of ...
Haoyang Liu, Keqin Liu, Qing Zhao
ICASSP
2011
IEEE
13 years 7 days ago
Logarithmic weak regret of non-Bayesian restless multi-armed bandit
Abstract—We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. At each time, a player chooses K out of N (N > K) arms to play. The state of each ar...
Haoyang Liu, Keqin Liu, Qing Zhao
ECCV
2008
Springer
14 years 10 months ago
What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?
Many computer vision algorithms require searching a set of images for similar patches, which is a very expensive operation. In this work, we compare and evaluate a number of neares...
Neeraj Kumar, Li Zhang, Shree K. Nayar
WSC
1997
13 years 10 months ago
Evaluation of a (R, s, Q, c) Multi-Item Inventory Replenishment Policy Through Simulation
In this paper, the case of a cardboard box marketing firm is studied and a (R,s,Q,c) inventory replenishment policy is proposed and evaluated by means of discrete event simulation...
Carlos B. Ramirez Cerda, Armando J. Espinosa de lo...