1554 search results - page 208 / 311 » Parameterized Complexity and Approximation Algorithms |
169
click to vote
PKDD
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achi...
145
click to vote
MDM
2009
Springer
15 years 9 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
159
click to vote
ICTAI
1997
IEEE
15 years 6 months ago
1997
IEEE
This paper tackles the problem of analyzing the correctness and performance of a computer network protocol. Given the complexity of the problem, no currently used technique is abl...
131
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
121
click to vote
IM
2007
15 years 3 months ago
2007
In this paper we suggest evaluating the importance of a website with the mean frequency of visiting the website for the Markov chain on the Internet Graph describing random surfi...