Sciweavers

463 search results - page 70 / 93
» A General Framework for Graph Sparsification
Sort
View
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
15 years 8 months ago
Stability in the self-organized evolution of networks
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
Thomas Jansen, Madeleine Theile
SIGCOMM
2004
ACM
15 years 7 months ago
Routing in a delay tolerant network
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
Sushant Jain, Kevin R. Fall, Rabin K. Patra
SP
1998
IEEE
116views Security Privacy» more  SP 1998»
15 years 6 months ago
Strand Spaces: Why is a Security Protocol Correct?
A strand is a sequence of events; it represents either the execution of legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a ...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...
CCS
2008
ACM
15 years 3 months ago
Measuring network security using dynamic bayesian network
Given the increasing dependence of our societies on networked information systems, the overall security of these systems should be measured and improved. Existing security metrics...
Marcel Frigault, Lingyu Wang, Anoop Singhal, Sushi...
MONET
2006
107views more  MONET 2006»
15 years 1 months ago
Utilization and fairness in spectrum assignment for opportunistic spectrum access
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive d...
Chunyi Peng, Haitao Zheng, Ben Y. Zhao