9841 search results - page 83 / 1969 » Distributed Value Functions |
AAAI
2000
14 years 11 months ago
2000
The complexity of numerical domain partitioning depends on the number of potential cut points. In multiway partitioning this dependency is often quadratic, even exponential. There...
VIS
2007
IEEE
15 years 11 months ago
2007
IEEE
Volumetric data commonly has high depth complexity which makes it difficult to judge spatial relationships accurately. There are many different ways to enhance depth perception, su...
CHARME
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
AAAI
2006
14 years 11 months ago
2006
Reinforcement learning problems are commonly tackled with temporal difference methods, which attempt to estimate the agent's optimal value function. In most real-world proble...
105
click to vote
ICDCS
2007
IEEE
15 years 1 months ago
2007
IEEE
On-line decision making often involves query processing over time-varying data which arrives in the form of data streams from distributed locations. In such environments typically...