909 search results - page 34 / 182 » On the approximability of some network design problems |
138
click to vote
WCNC
2008
IEEE
15 years 8 months ago
2008
IEEE
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...
130
click to vote
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
OPODIS
2008
15 years 2 months ago
2008
Abstract. We consider the following model of cellular networks. Each base station has a given finite capacity, and each client has some demand and profit. A client can be covered b...
108
click to vote
IJPRAI
1998
15 years 1 months ago
1998
We present in this paper a novel method for eliciting the conditional probability matrices needed for a Bayesian network with the help of a neural network. We demonstrate how we c...
127
click to vote
PVLDB
2010
14 years 12 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...