2799 search results - page 219 / 560 » The regenerator location problem |
172
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
179
click to vote
IROS
2007
IEEE
16 years 26 days ago
2007
IEEE
– A problem of searching with multiple searchers and scouts is presented. Unlike most search problems that terminate as soon as the target is found, successful detections by scou...
164
click to vote
WADS
1997
Springer
15 years 10 months ago
1997
Springer
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
206
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
169
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
The paper studies the optimal placement of multiple cameras and the selection of the best subset of cameras for single target localization in the framework of sensor networks. The ...