Sciweavers

5898 search results - page 1052 / 1180
» Parallel Computing Environments and Methods
Sort
View
117
Voted
ICPP
2005
IEEE
15 years 10 months ago
A Hybrid Searching Scheme in Unstructured P2P Networks
The existing searching schemes in Peer-to-Peer (P2P) networks are either forwarding-based or non-forwarding based. In forwarding-based schemes, queries are forwarded from the quer...
Xiuqi Li, Jie Wu
139
Voted
PODC
2005
ACM
15 years 10 months ago
Proof labeling schemes
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
Amos Korman, Shay Kutten, David Peleg
SPAA
2004
ACM
15 years 10 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
ICDCS
2003
IEEE
15 years 10 months ago
Effective Delay Control for High Rate Heterogeneous Real-time Flows
This paper presents a new method to control the delay performance for high rate heterogeneous real-time traffic flows based on a novel traffic control algorithm which is a gene...
Weijia Jia, Hanxing Wang, Maoning Tang, Wei Zhao
ICDCS
2003
IEEE
15 years 10 months ago
Enhancing The Fault-Tolerance of Nonmasking Programs
In this paper, we focus on automated techniques to enhance the fault-tolerance of a nonmasking fault-tolerant program to masking. A masking program continually satisfies its spec...
Sandeep S. Kulkarni, Ali Ebnenasir
« Prev « First page 1052 / 1180 Last » Next »