608 search results - page 51 / 122 » Random Systems with Complete Connections |
OPODIS
2007
14 years 11 months ago
2007
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
ANSS
2004
IEEE
15 years 1 months ago
2004
IEEE
The Random Early Detection (RED) scheme for congestion control in TCP is well known over a decade. Due to a number of control parameters in RED, it cannot make acceptable packet-d...
ICAI
2003
14 years 11 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
TON
2008
14 years 9 months ago
2008
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
103
click to vote
TMC
2010
14 years 8 months ago
2010
– While a lot of existing research attempts to extend the lifetime of a wireless sensor network (WSN) by designing energy efficient networking protocols, the impact of random dev...