Sciweavers

2223 search results - page 137 / 445
» Ontological Framework for Approximation
Sort
View
166
Voted
IFIP
2005
Springer
15 years 11 months ago
Numerical Approximation of a Control Problem for Advection-Diffusion Processes
Two different approaches are proposed to enhance the efficiency of the numerical resolution of optimal control problems governed by a linear advection– diffusion equation. In ...
Alfio Quarteroni, Gianluigi Rozza, L. Dedè,...
160
Voted
ENTCS
2008
97views more  ENTCS 2008»
15 years 6 months ago
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
Karl-Heinz Pennemann
172
Voted
SIGDIAL
2010
15 years 4 months ago
Sparse Approximate Dynamic Programming for Dialog Management
Spoken dialogue management strategy optimization by means of Reinforcement Learning (RL) is now part of the state of the art. Yet, there is still a clear mismatch between the comp...
Senthilkumar Chandramohan, Matthieu Geist, Olivier...
190
Voted
NN
2010
Springer
187views Neural Networks» more  NN 2010»
15 years 27 days ago
Efficient exploration through active learning for value function approximation in reinforcement learning
Appropriately designing sampling policies is highly important for obtaining better control policies in reinforcement learning. In this paper, we first show that the least-squares ...
Takayuki Akiyama, Hirotaka Hachiya, Masashi Sugiya...
195
Voted
AAAI
2011
14 years 6 months ago
Lossy Conservative Update (LCU) Sketch: Succinct Approximate Count Storage
In this paper, we propose a variant of the conservativeupdate Count-Min sketch to further reduce the overestimation error incurred. Inspired by ideas from lossy counting, we divid...
Amit Goyal, Hal Daumé III