Sciweavers

4642 search results - page 271 / 929
» Distributed algorithm and reversible network
Sort
View
TAAS
2008
70views more  TAAS 2008»
15 years 6 months ago
A general characterization of indulgence
characterization of indulgence in an abstract computing model that encompasses various communication and resilience schemes. We use our characterization to establish several result...
Rachid Guerraoui, Nancy A. Lynch
IPPS
1996
IEEE
15 years 10 months ago
Generic Methodologies for Deadlock-Free Routing
This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic depen...
Hyunmin Park, Dharma P. Agrawal
ISIPTA
2005
IEEE
157views Mathematics» more  ISIPTA 2005»
16 years 7 days ago
Possibilistic Networks with Locally Weighted Knowledge Bases
Possibilistic networks and possibilistic logic bases are important tools to deal with uncertain pieces of information. Both of them offer a compact representation of possibility ...
Salem Benferhat, Salma Smaoui
GCC
2007
Springer
16 years 24 days ago
Telemeter: Network Distance Prediction Base on Network Topology
Coordinates-based distance prediction algorithms can improve the performance of many Internet applications, especially in the peer-to-peer architecture and overlay construction. B...
Lin Cong, Yang Chen, Xiaohui Shi, Ye Wang, Weiyu W...
SPAA
2004
ACM
16 years 2 days ago
Improved combination of online algorithms for acceptance and rejection
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
David P. Bunde, Yishay Mansour