393 search results - page 4 / 79 » Personnel scheduling: Models and complexity |
DISOPT
2006
14 years 9 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
MOBIHOC
2009
ACM
15 years 10 months ago
2009
ACM
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
NGITS
1995
Springer
15 years 1 months ago
1995
Springer
This paper investigates the problem ofautomatically learning declarative models of information sources available on the Internet. We report on ILA, a domain-independent program th...
79
Voted
FTCS
1997
14 years 11 months ago
1997
Fast turnaroundtime independabilityevaluation iscrucialfor e cient fault-tolerant system design and dependability of the resulting product since timely feedbacks will allow more i...