530 search results - page 36 / 106 » An Algorithm for Approximating the Satisfiability Problem of... |
SODA
2008
ACM
13 years 9 months ago
2008
ACM
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
ICALP
2003
Springer
14 years 1 months ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
IPCO
2010
13 years 9 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The problem of discrete universal filtering, in which the components of a discrete signal emitted by an unknown source and corrupted by a known discrete memoryless channel (DMC) ar...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
This paper studies the infinite-horizon sensor scheduling problem for linear Gaussian processes with linear measurement functions. Several important properties of the optimal infin...