Sciweavers

1301 search results - page 114 / 261
» Bounded Version Vectors
Sort
View
89
Voted
WEA
2007
Springer
95views Algorithms» more  WEA 2007»
15 years 6 months ago
Experimental Evaluation of Parametric Max-Flow Algorithms
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
Maxim A. Babenko, Jonathan Derryberry, Andrew V. G...
110
Voted
ICRA
2006
IEEE
111views Robotics» more  ICRA 2006»
15 years 6 months ago
Placement and Distributed Deployment of Sensor Teams for Triangulation based Localization
— We address the problem of placing a sensor network so as to minimize the uncertainty in estimating the position of targets. The novelty of our formulation is in the sensing mod...
Volkan Isler
INFOCOM
2005
IEEE
15 years 6 months ago
Online time-constrained scheduling in linear networks
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
Joseph Naor, Adi Rosén, Gabriel Scalosub
93
Voted
ISAAC
2004
Springer
115views Algorithms» more  ISAAC 2004»
15 years 6 months ago
Multicriteria Global Minimum Cuts
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
Amitai Armon, Uri Zwick
96
Voted
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
15 years 6 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao