1620 search results - page 84 / 324 » An Annotation-Based Framework for Parallel Computing |
130
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
The design of algorithms that can run unchanged yet efficiently on a variety of machines characterized by different degrees of parallelism and communication capabilities is a hig...
134
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract—In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with Time Windows (CV...
172
click to vote
ICPP
1991
IEEE
15 years 8 months ago
1991
IEEE
Data decomposition is probably the most successful method for generating parallel programs. In this paper a general framework is described for the automatic generation of parallel...
116
click to vote
CONCUR
2008
Springer
15 years 6 months ago
2008
Springer
We consider nondeterministic and probabilistic termination problems in a process algebra that is equivalent to basic chemistry. We show that the existence of a terminating computat...
137
click to vote
CCGRID
2009
IEEE
15 years 11 months ago
2009
IEEE
The deluge of available data for analysis demands the need to scale the performance of data mining implementations. With the current architectural trends, one of the major challen...