7015 search results - page 425 / 1403 » Approximation algorithms for co-clustering |
167
click to vote
SSS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. For large distributed systems built from inexpensive components, one expects to see incessant failures. This paper proposes two models for such faults and analyzes two we...
156
click to vote
ICANNGA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel ge...
174
Voted
COCOON
2005
Springer
16 years 12 days ago
2005
Springer
The Reverse Greedy algorithm (RGREEDY) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the...
190
click to vote
ESA
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
199
click to vote
IRREGULAR
1995
Springer
15 years 10 months ago
1995
Springer
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...