745 search results - page 135 / 149 » On Generating Random Network Structures: Connected Graphs |
109
Voted
CORR
2008
Springer
15 years 16 days ago
2008
Springer
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
ATMOS
2010
14 years 11 months ago
2010
Calculating timetables that are insensitive to disturbances has drawn considerable research efforts due to its practical importance on the one hand and its hard tractability by c...
125
click to vote
CORR
2008
Springer
15 years 16 days ago
2008
Springer
Getting agents in the Internet, and in networks in general, to invest in and deploy security features and protocols is a challenge, in particular because of economic reasons arisi...
102
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
107
Voted
AMAI
2004
Springer
15 years 5 months ago
2004
Springer
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...