3894 search results - page 18 / 779 » Approximation Algorithms for Biclustering Problems |
162
Voted
EUROCAST
2009
Springer
16 years 28 days ago
2009
Springer
In this paper we present new local search algorithms for the Probabilistic Traveling Salesman Problem (PTSP) using sampling and ad-hoc approximation. These algorithms improve both...
157
Voted
ICRA
2008
IEEE
16 years 24 days ago
2008
IEEE
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...
133
Voted
TCBB
2008
15 years 6 months ago
2008
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
197
Voted
COCOON
2007
Springer
16 years 16 days ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
173
Voted
PPAM
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...