40 search results - page 5 / 8 » On Failure of 0-1 Laws |
WDAG
2009
Springer
14 years 2 months ago
2009
Springer
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— Consider a generic data unit of random size L that needs to be transmitted over a channel of unit capacity. The channel dynamics is modeled as an on-off process {(Ai, Ui)}i≥1...
SIGCOMM
2006
ACM
14 years 1 months ago
2006
ACM
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
IEEEAMS
2003
IEEE
14 years 22 days ago
2003
IEEE
This paper attempts to identify one of the necessary conditions for self-healing, or self-repair, in complex systems, and to propose means for satisfying this condition in heterog...
HICSS
2010
IEEE
14 years 2 months ago
2010
IEEE
In this paper we explore the interaction between a dynamic model of the power transmission system (OPA) and a simple economic model of power generation development. Despite the si...