Sciweavers

7758 search results - page 413 / 1552
» On the Number of Distributive Lattices
Sort
View
165
Voted
ISPAN
2005
IEEE
16 years 13 days ago
Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications
Abstract—In real networks, disjoint paths are needed for providing protection against single link/node failure. When disjoint paths cannot be found, an alternative solution is to...
Bing Yang, Mei Yang, Jianping Wang, S. Q. Zheng
PODC
2005
ACM
16 years 12 days ago
On reliable broadcast in a radio network
— We consider the problem of reliable broadcast in an infinite grid (or finite toroidal) radio network under Byzantine and crash-stop failures. We present bounds on the maximum...
Vartika Bhandari, Nitin H. Vaidya
PDCAT
2005
Springer
16 years 10 days ago
Approximating Spanning Trees with Inner Nodes Cost
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
168
Voted
PDCAT
2005
Springer
16 years 10 days ago
Access Control List Mediation System for Large-Scale Network
Large-Scale network such as the Internet consist of a large number of sub-networks. Since each subnetwork has management privileges and policies individually, it is difficult to r...
Kanghee Lee, Zhefan Jiang, Sangok Kim, Sangwook Ki...
GRID
2005
Springer
16 years 9 days ago
Bridging organizational network boundaries on the grid
— The Grid offers significant opportunities for performing wide area distributed computing, allowing multiple organizations to collaborate and build dynamic and flexible virtual ...
Jefferson Tan, David Abramson, Colin Enticott