Sciweavers

334 search results - page 38 / 67
» Inapproximability of Survivable Networks
Sort
View
DSN
2000
IEEE
14 years 1 months ago
Whither Generic Recovery from Application Faults? A Fault Study using Open-Source Software
This paper tests the hypothesis that generic recovery techniques, such as process pairs, can survive most application faults without using application-specific information. We ex...
Subhachandra Chandra, Peter M. Chen
JAL
2002
71views more  JAL 2002»
13 years 8 months ago
A primal-dual schema based approximation algorithm for the element connectivity problem
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, Dav...
CN
2010
120views more  CN 2010»
13 years 8 months ago
A survey on bio-inspired networking
The developments in the communication and networking technologies have yielded many existing and envisioned information network architectures such as cognitive radio networks, sen...
Falko Dressler, Özgür B. Akan
MASCOTS
2001
13 years 10 months ago
PTPlan MPLS: A Tool for MPLS Network Dimensioning
This paper presents a tool for MPLS network dimensioning that allows for multi-hour dimensioning of networks supporting simultaneously peer-to-peer and client-server services. The...
Luís Cardoso, Jorge Patrão, Carlos L...
IJCNN
2006
IEEE
14 years 2 months ago
Bimodal Integration of Phonemes and Letters: an Application of Multimodal Self-Organizing Networks
— Multimodal integration of sensory information has clear advantages for survival: events that can be sensed in more than one modality are detected more quickly and accurately, a...
Lennart Gustafsson, Andrew P. Paplinski