299 search results - page 15 / 60 » DNA Computing for Complex Scheduling Problem |
SPAA
2006
ACM
15 years 5 months ago
2006
ACM
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
INFORMATICALT
2006
14 years 11 months ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
A heterogeneous multi-processor (HeMP) system consists of several heterogeneous processors, each of which is specially designed to deliver the best energy-saving performance for a...
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems with hierarchical architectures. In contrast to the heuristic approache...
113
click to vote
ICICIC
2006
IEEE
15 years 5 months ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...