4007 search results - page 694 / 802 » Computation with imprecise probabilities |
131
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
In this paper, we discuss the use of Targeted Trajectory Distribution Markov Decision Processes (TTD-MDPs)—a variant of MDPs in which the goal is to realize a specified distrib...
180
click to vote
IPSN
2007
Springer
15 years 11 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
139
click to vote
IJCNN
2006
IEEE
15 years 11 months ago
2006
IEEE
— It is difficult to map many existing learning algorithms onto biological networks because the former require a separate learning network. The computational basis of biological...
199
click to vote
FOCS
2005
IEEE
15 years 11 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
176
click to vote
INFOCOM
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...