112 search results - page 16 / 23 » Constant factor approximation of vertex-cuts in planar graph... |
172
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Robotic swarms, like all spatial computers, are a challenging environment for the execution of distributed consensus algorithms due to their scale, diameter, and frequent failures...
137
click to vote
FOCS
2009
IEEE
16 years 22 days ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
141
click to vote
FOCS
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
204
click to vote
MOBICOM
2006
ACM
15 years 12 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
185
click to vote
ICDCSW
2009
IEEE
16 years 20 days ago
2009
IEEE
We describe a novel Geometric Localized Routing (GLR) protocol in Disruption (Delay) Tolerant Network (DTN). Although DTNs do not guarantee the connectivity of the network all the...