1095 search results - page 191 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
BMCBI
2007
14 years 9 months ago
2007
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
We consider the problem of broadcasting a large message in a large scale distributed platform. The message must be sent from a source node, with the help of the receiving peers whi...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
ICPP
2007
IEEE
15 years 4 months ago
2007
IEEE
Ever-increasing memory footprint of applications and increasing mainstream popularity of shared memory parallel computing motivate us to explore memory compression potential in di...
ICSE
2008
IEEE-ACM
15 years 10 months ago
2008
IEEE-ACM
In grid workflow systems, temporal correctness is critical to assure the timely completion of grid workflow execution. To monitor and control the temporal correctness, fixed-time ...