242 search results - page 31 / 49 » Provably Bounded Optimal Agents |
TON
2008
13 years 7 months ago
2008
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
ROBOCOMM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Consider the following scenario: a spatio-temporal stochastic process generates service requests, localized at points in a bounded region on the plane; these service requests a...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
SIGMOD
2006
ACM
14 years 8 months ago
2006
ACM
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
EDBT
2010
ACM
14 years 2 months ago
2010
ACM
The existing solutions to privacy preserving publication can be classified into the theoretical and heuristic categories. The former guarantees provably low information loss, whe...