745 search results - page 39 / 149 » On Generating Random Network Structures: Connected Graphs |
CN
2006
15 years 16 days ago
2006
Though Connection Admission Control (CAC) in wireless networks has been studied extensively, the heterogeneous structure of Next Generation Wireless Systems (NGWS) makes CAC very ...
127
click to vote
MOBICOM
2003
ACM
15 years 5 months ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
107
click to vote
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
SASO
2008
IEEE
15 years 6 months ago
2008
IEEE
Many real–world networks show a scale–free degree distribution, a structure that is known to be very stable in case of random failures. Unfortunately, the very same structure ...