526 search results - page 63 / 106 » Efficient Algorithms for Online Decision Problems |
132
Voted
ICPP
1999
IEEE
15 years 8 months ago
1999
IEEE
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
117
click to vote
IJCAI
2003
15 years 5 months ago
2003
The aim of this paper is to provide a sound framework for addressing a difficult problem: the automatic construction of an autonomous agent's modular architecture. We briefly...
129
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
157
click to vote
WEBDB
2010
Springer
15 years 9 months ago
2010
Springer
An important requirement for emerging applications which aim to locate and integrate content distributed over the Web is to identify pages that are relevant for a given domain or ...
127
click to vote
WWW
2009
ACM
16 years 4 months ago
2009
ACM
This paper proposes an efficient relevance feedback based interactive model for keyword generation in sponsored search advertising. We formulate the ranking of relevant terms as a...