5595 search results - page 347 / 1119 » Approximation Algorithms for Clustering Problems |
212
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
154
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and re...
178
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
209
click to vote
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
In Simultaneous Localisation and Mapping (SLAM), it is well known that probabilistic filtering approaches which aim to estimate the robot and map state sequentially suffer from poo...
189
click to vote
HIS
2003
15 years 8 months ago
2003
Abstract. This paper proposes the fitness control procedure for the application of genetic algorithms (GA) in pattern recognition. Instead of using GA to solve a concomitant optim...