Sciweavers

838 search results - page 19 / 168
» On the Robustness of Complex Networks by Using the Algebraic...
Sort
View
SJ
2011
13 years 2 months ago
Analyzing the Resilience of Complex Supply Network Topologies Against Random and Targeted Disruptions
—In this paper, we study the resilience of supply networks against disruptions and provide insights to supply chain managers on how to construct a resilient supply network from t...
Kang Zhao, Akhil Kumar, Terry P. Harrison, John Ye...
NIPS
1993
13 years 9 months ago
Analyzing Cross-Connected Networks
The non-linear complexities of neural networks make network solutions difficult to understand. Sanger's contribution analysis is here extended to the analysis of networks aut...
Thomas R. Shultz, Jeffrey L. Elman
DCOSS
2005
Springer
14 years 1 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
TISSEC
2002
123views more  TISSEC 2002»
13 years 7 months ago
An algebraic approach to IP traceback
We present a new solution to the problem of determining the path a packet traversed over the Internet (called the traceback problem) during a denial of service attack. Previous so...
Drew Dean, Matthew K. Franklin, Adam Stubblefield
WS
2004
ACM
14 years 1 months ago
JANUS: towards robust and malicious resilient routing in hybrid wireless networks
In this paper we investigate and provide solutions for security threats in the context of hybrid networks consisting of a cellular base station and mobile devices equipped with du...
Bogdan Carbunar, Ioannis Ioannidis, Cristina Nita-...