11371 search results - page 131 / 2275 » The network inhibition problem |
219
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
Abstract—Network power consumption can be reduced considerably by adapting link data rates to their offered traffic loads. In this paper, we exploit how to leverage rate adaptat...
155
click to vote
UAI
1994
15 years 7 months ago
1994
We show how to nd a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the rst step in the method of conditioning for inference....
221
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...
201
click to vote
TASE
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we focus on mechanism design for single leader Stackelberg problems, which are a special case of hierarchical decision making problems in which a distinguished agent...
260
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...