5595 search results - page 148 / 1119 » Approximation Algorithms for Clustering Problems |
156
click to vote
OSDI
2008
ACM
16 years 5 months ago
2008
ACM
Artemis is a modular application designed for analyzing and troubleshooting the performance of large clusters running datacenter services. Artemis is composed of four modules: (1)...
134
Voted
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
198
Voted
SMC
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
151
Voted
MOR
2000
15 years 4 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
151
Voted
DSD
2005
IEEE
15 years 10 months ago
2005
IEEE
An implementation of an algorithm for string matching, commonly used in DNA string analysis, using configurable technology is proposed. The design of the circuit allows for pipeli...