575 search results - page 24 / 115 » Computing Maximum Subsequence in Parallel |
EUROPAR
2010
Springer
13 years 7 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
HAPTICS
2007
IEEE
14 years 1 months ago
2007
IEEE
Knob turning is a common task that should influence the design of human-machine interfaces such as prosthetic arms, teleoperated robots, and virtual environments. This study exam...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued perform...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Computational phylogeny is a challenging application even for the most powerful supercomputers. It is also an ideal candidate for benchmarking emerging multiprocessor architecture...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...