925 search results - page 144 / 185 » Connectivity on Complete Lattices |
CN
2006
13 years 7 months ago
2006
Single- and multiple-link failure resilience are of critical importance in survivable wavelength division multiplexed (WDM) optical network design. Networks are not made up simply...
CN
2006
13 years 7 months ago
2006
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...
COMCOM
2006
13 years 7 months ago
2006
In the paper, we consider a preference heterogeneity problem in large-scale multicast applications. Abundant content, data type and diverse members' interests naturally lead ...
COMBINATORICA
2007
13 years 7 months ago
2007
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...