667 search results - page 96 / 134 » Approximation algorithms for connected facility location pro... |
112
Voted
ESCIENCE
2005
IEEE
15 years 6 months ago
2005
IEEE
DIET (Distributed Interactive Engineering Toolbox) is a set of hierarchical components to design Network Enabled Server (NES) systems. In these systems, clients ask to agents (dis...
114
Voted
STOC
2006
ACM
16 years 25 days ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
101
click to vote
CORR
2008
Springer
15 years 19 days ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
104
Voted
SIAMIS
2010
14 years 11 months ago
2010
We present a novel deconvolution approach to accurately restore piecewise smooth signals from blurred data. The first stage uses Higher Order Total Variation restorations to obtai...
94
Voted
CORR
2007
Springer
15 years 15 days ago
2007
Springer
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...