299 search results - page 17 / 60 » DNA Computing for Complex Scheduling Problem |
IJHPCA
2006
14 years 11 months ago
2006
In this paper we study the scheduling of multiple divisible loads on a star network of processors. We show that this problem is computationally hard. Special cases solvable in pol...
101
click to vote
BMCBI
2006
14 years 11 months ago
2006
Background: Many genome projects are left unfinished due to complex, repeated regions. Finishing is the most time consuming step in sequencing and current finishing tools are not ...
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— Optical Burst and Packet Switching are being considered as the most promising paradigms to increase bandwidth efficiency in IP over DWDM networks. In both cases, due t...
PIMRC
2008
IEEE
15 years 6 months ago
2008
IEEE
—In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a majo...
KR
1989
Springer
15 years 3 months ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...