241 search results - page 39 / 49 » Fast heuristics for large scale covering-location problems |
146
click to vote
WAE
2001
14 years 11 months ago
2001
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
ICDE
2008
IEEE
15 years 4 months ago
2008
IEEE
— Similarity joins have attracted significant interest, with applications in Geographical Information Systems, astronomy, marketing analyzes, and anomaly detection. However, all...
CLUSTER
2000
IEEE
15 years 2 months ago
2000
IEEE
To construct a large commodity clustec a hierarchical network is generally adopted for connecting the host muchines, where a Gigabit backbone switch connects a few commodity switc...
JPDC
2007
14 years 9 months ago
2007
In this paper, we address the problem of multiple sequence alignment (MSA) for handling very large number of proteins sequences on mesh-based multiprocessor architectures. As the ...