658 search results - page 129 / 132 » Lower bounds for sorting networks |
168
click to vote
TSP
2010
15 years 12 days ago
2010
We formulate and study a decentralized multi-armed bandit (MAB) problem. There are distributed players competing for independent arms. Each arm, when played, offers i.i.d. reward a...
201
click to vote
PODC
2012
ACM
13 years 8 months ago
2012
ACM
In recent years, there have been a few proposals to add a small amount of trusted hardware at each replica in a Byzantine fault tolerant system to cut back replication factors. Th...
175
Voted
FCT
2009
Springer
16 years 9 days ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
250
click to vote
VLDB
2004
ACM
16 years 6 months ago
2004
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
171
click to vote
SIGMOD
2003
ACM
16 years 5 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...