2421 search results - page 29 / 485 » Approximate Flow-Aware Networking |
109
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
122
click to vote
IPL
2008
14 years 11 months ago
2008
Bayesian Network structures with a maximum in-degree of k can be approximated with respect to a positive scoring metric up to an factor of 1/k. Key words: approximation algorithm,...
COLOGNETWENTE
2008
15 years 1 months ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
110
click to vote
ISIPTA
2005
IEEE
15 years 5 months ago
2005
IEEE
Graph-theoretical representations for sets of probability measures (credal networks) generally display high complexity, and approximate inference seems to be a natural solution fo...
BROADNETS
2005
IEEE
15 years 5 months ago
2005
IEEE
