Sciweavers

2814 search results - page 538 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
EDBT
2009
ACM
122views Database» more  EDBT 2009»
13 years 11 months ago
Finding the influence set through skylines
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...
Xiaobing Wu, Yufei Tao, Raymond Chi-Wing Wong, Lin...
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
13 years 11 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
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 ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
ATAL
2006
Springer
13 years 11 months ago
Forming efficient agent groups for completing complex tasks
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 ...
Efrat Manisterski, Esther David, Sarit Kraus, Nich...
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
13 years 11 months ago
Flexible constrained spectral clustering
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
Xiang Wang, Ian Davidson
ATAL
2008
Springer
13 years 9 months ago
A realistic model of frequency-based multi-robot polyline patrolling
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...
Yehuda Elmaliach, Asaf Shiloni, Gal A. Kaminka