4850 search results - page 25 / 970 » Approximate Data Structures with Applications |
100
click to vote
DAGSTUHL
2007
15 years 3 months ago
2007
Approximations can aim at having close to optimal value or, alternatively, they can aim at structurally resembling an optimal solution. Whereas value-approximation has been extensi...
121
click to vote
AMAI
2006
Springer
15 years 2 months ago
2006
Springer
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
102
click to vote
IWANN
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. This paper presents k-NN as an approximator for time series prediction problems. The main advantage of this approximator is its simplicity. Despite the simplicity, k-NN c...
127
click to vote
EMSOFT
2004
Springer
15 years 7 months ago
2004
Springer
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
123
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In this paper we study stochastic dynamic games with many players that are relevant for a wide range of social, economic, and engineering applications. The standard solution conce...