463 search results - page 91 / 93 » A General Framework for Graph Sparsification |
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
Traditionally, ad hoc networks have been viewed as a connected graph over which end-to-end routing paths had to be established. Mobility was considered a necessary evil that inval...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...