299 search results - page 3 / 60 » DNA Computing for Complex Scheduling Problem |
KR
2004
Springer
13 years 10 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
MOBIHOC
2007
ACM
14 years 4 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
ATAL
2009
Springer
13 years 12 months ago
2009
Springer
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
JVA
2006
IEEE
13 years 11 months ago
2006
IEEE
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
RTSS
2003
IEEE
13 years 10 months ago
2003
IEEE
The Pfair algorithms are optimal for independent periodic real-time tasks executing on a multiple-resource system, however, they incur a high scheduling overhead by making schedul...