2814 search results - page 538 / 563 » Competitive Analysis of Distributed Algorithms |
130
click to vote
EDBT
2009
ACM
15 years 6 months ago
2009
ACM
Given a set P of products, a set O of customers, and a product p P, a bichromatic reverse skyline query retrieves all the customers in O that do not find any other product in P t...
104
click to vote
COCO
2009
Springer
15 years 6 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
116
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working ...
141
click to vote
KDD
2010
ACM
15 years 5 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
146
Voted
ATAL
2008
Springer
15 years 4 months ago
2008
Springer
There is growing interest in multi-robot frequency-based patrolling, in which a team of robots optimizes its frequency of point visits, for every point in a target work area. In p...