7189 search results - page 108 / 1438 » Connecting Design with Code |
171
click to vote
SIGMETRICS
2006
ACM
16 years 8 days ago
2006
ACM
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
189
click to vote
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
192
click to vote
USENIX
2001
15 years 7 months ago
2001
The rapid growth of the Internet has made IP addresses a scarce resource. To get around this problem, today and in the foreseeable future, networks will be deployed with reusable-...
202
click to vote
TMC
2008
15 years 6 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
147
click to vote
CHI
2009
ACM
16 years 7 months ago
2009
ACM
Web search and browsing have been streamlined for a comfortable experience when the network connection is fast. Existing tools, however, are not optimized for scenarios where conn...