23557 search results - page 4459 / 4712 » Distributed Computing - Introduction |
127
click to vote
INFOCOM
2002
IEEE
15 years 7 months ago
2002
IEEE
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...
145
Voted
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
170
click to vote
SIGMETRICS
2010
ACM
15 years 7 months ago
2010
ACM
A new generation of content delivery networks for live streaming, video on demand, and software updates takes advantage of a peer-to-peer architecture to reduce their operating co...
125
click to vote
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
130
click to vote
APN
2010
Springer
15 years 7 months ago
2010
Springer
Service-oriented computing proposes services as building blocks which can be composed to complex systems. To reason about the correctness of a service, its communication protocol n...