Sciweavers

874 search results - page 128 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
ICML
1998
IEEE
15 years 10 months ago
The MAXQ Method for Hierarchical Reinforcement Learning
This paper presents a new approach to hierarchical reinforcement learning based on the MAXQ decomposition of the value function. The MAXQ decomposition has both a procedural seman...
Thomas G. Dietterich
SIGMOD
2005
ACM
118views Database» more  SIGMOD 2005»
15 years 10 months ago
RPJ: Producing Fast Join Results on Streams through Rate-based Optimization
We consider the problem of "progressively" joining relations whose records are continuously retrieved from remote sources through an unstable network that may incur temp...
Yufei Tao, Man Lung Yiu, Dimitris Papadias, Marios...
DCC
2004
IEEE
15 years 9 months ago
Efficient Bit Allocation for Dependent Video Coding
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
Yegnaswamy Sermadevi, Sheila S. Hemami
SEMWEB
2009
Springer
15 years 4 months ago
Scalable Distributed Reasoning Using MapReduce
We address the problem of scalable distributed reasoning, proposing a technique for materialising the closure of an RDF graph based on MapReduce. We have implemented our approach o...
Jacopo Urbani, Spyros Kotoulas, Eyal Oren, Frank v...
ROBOCOMM
2007
IEEE
15 years 4 months ago
Path planning using Shi and Karl level sets
—Path planning for mobile robots is a well researched problem for over three decades. In this paper, we test and evaluate a new approach based on Shi and Karl Level Sets for mobi...
Randeep Singh, Nagaraju Bussa