16404 search results - page 634 / 3281 » A set coverage problem |
194
click to vote
CN
2007
15 years 7 months ago
2007
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximu...
211
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—In IEEE 802.22 Wireless Regional Area Networks (WRANs), each Base Station (BS) solves a complex resource allocation problem of simultaneously determining the channel to reuse, p...
240
click to vote
COCOA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
206
click to vote
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
—Correlation clustering problem is a NP hard problem and technologies for the solving of correlation clustering problem can be used to cluster given data set with relation matrix...
175
click to vote
COLT
2008
Springer
15 years 9 months ago
2008
Springer
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...