658 search results - page 121 / 132 » Lower bounds for sorting networks |
FLAIRS
2006
13 years 9 months ago
2006
In real-life decision analysis, the probabilities and values of consequences are in general vague and imprecise. One way to model imprecise probabilities is to represent a probabi...
SIROCCO
2000
13 years 9 months ago
2000
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
ALGORITHMICA
2010
13 years 7 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The problem of distributed learning and channel access is considered in a cognitive network with multiple secondary users. The availability statistics of the channels are initially...
DC
2008
13 years 7 months ago
2008
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...