1026 search results - page 119 / 206 » On Finding Minimal w-cutset |
JAL
2006
13 years 10 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
PAMI
2006
13 years 10 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
PE
2006
Springer
13 years 10 months ago
2006
Springer
We ask the question, "for minimizing mean response time (sojourn time), which is preferable: one fast server of speed 1, or k slow servers each of speed 1/k?" Our settin...
PR
2006
13 years 10 months ago
2006
In this paper we introduce a new embedding technique to find the linear projection that best projects labeled data samples into a new space where the performance of a Nearest Neig...
TKDE
2008
13 years 10 months ago
2008
We present a genetic algorithm for tackling a file assignment problem for a large-scale video-on-demand system. The file assignment problem is to find the optimal replication and a...