104 search results - page 15 / 21 » Nodes of large degree in random trees and forests |
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes...
PVLDB
2010
13 years 7 months ago
2010
Large flash disks, or solid state drives (SSDs), have become an attractive alternative to magnetic hard disks, due to their high random read performance, low energy consumption a...
SPAA
2004
ACM
14 years 2 months ago
2004
ACM
The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for t...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Topology control and routing protocols are used by designers of wireless packet data networks to lower the node degree, simplify routing and lower the nodes’ energy consumpti...