104 search results - page 8 / 21 » Adaptive Precision Setting for Cached Approximate Values |
AI
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
ECIR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. The Information Retrieval community uses a variety of performance measures to evaluate the effectiveness of scoring functions. In this paper, we show how to adapt six pop...
CPM
2000
Springer
15 years 2 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
AAMAS
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Reinforcement learning (RL) is a widely used learning paradigm for adaptive agents. There exist several convergent and consistent RL algorithms which have been intensivel...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...