Sciweavers

5624 search results - page 254 / 1125
» On Conditional Covering Problem
Sort
View
CDC
2010
IEEE
130views Control Systems» more  CDC 2010»
15 years 1 months ago
Decomposability of global tasks for multi-agent systems
Abstract-- Multi-agent system is a rapidly developing research area with strong support from both civilian and military applications. One of the essential problems in multi-agent s...
Mohammad Karimadini, Hai Lin 0002
SODA
2012
ACM
225views Algorithms» more  SODA 2012»
13 years 9 months ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave...
WWW
2007
ACM
16 years 7 months ago
The discoverability of the web
Previous studies have highlighted the high arrival rate of new content on the web. We study the extent to which this new content can be efficiently discovered by a crawler. Our st...
Anirban Dasgupta, Arpita Ghosh, Ravi Kumar, Christ...
DM
1998
81views more  DM 1998»
15 years 6 months ago
On intersecting hypergraphs
We investigate the following question: “Given an intersecting multi-hypergraph on n points, what fraction of edges must be covered by any of the best 2 points?” (Here “best...
Barry Guiduli, Zoltán Király
DCC
2003
IEEE
16 years 6 months ago
Design of Optimal Quantizers for Distributed Source Coding
We address the problem of designing optimal quantizers for distributed source coding. The generality of our formulation includes both the symmetric and asymmetric scenarios, toget...
David Rebollo-Monedero, Rui Zhang, Bernd Girod