7930 search results - page 1556 / 1586 » Greedy in Approximation Algorithms |
TAMC
2009
Springer
14 years 1 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
VLDB
2001
ACM
14 years 28 days ago
2001
ACM
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
HPDC
2000
IEEE
14 years 27 days ago
2000
IEEE
In this paper, we present a performance evaluation of a wide-area cluster system based on a rewallenabled Globus metacomputing toolkit. In order to establish communication links ...
INFOCOM
2000
IEEE
14 years 26 days ago
2000
IEEE
— While packet scheduling for wired links is a maturing area, scheduling of wireless links is less mature. A fundamental difference between wired and wireless links is that wirel...
PG
2000
IEEE
14 years 26 days ago
2000
IEEE
PDE surfaces, whose behavior is governed by Partial Differential Equations (PDEs), have demonstrated many modeling advantages in surface blending, free-form surface modeling, and ...