2520 search results - page 370 / 504 » The complexity of approximating entropy |
139
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
169
click to vote
ETFA
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— This article presents some results about schedulability analysis of tasks with offsets also known as transactions, in the particular case of monotonic transactions. The...
197
click to vote
SENSYS
2006
ACM
15 years 10 months ago
2006
ACM
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
137
click to vote
JCDL
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, we discuss the findings of an in-depth observational study of reading and within-document navigation and add to these findings the results of a second analysis of h...
135
click to vote
WEBDB
2005
Springer
15 years 10 months ago
2005
Springer
Querying document-centric XML collections with structure conditions improves retrieval precisions. The structures of such XML collections, however, are often too complex for users...