26 search results - page 3 / 6 » On unit task linear-nonlinear two-cluster scheduling problem |
AMAI
1999
Springer
13 years 5 months ago
1999
Springer
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
IPPS
2009
IEEE
14 years 9 days ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
CAAN
2006
Springer
13 years 9 months ago
2006
Springer
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...
RTSS
1992
IEEE
13 years 9 months ago
1992
IEEE
The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single unit software resources on a single processor is considered. The correctness condit...
COR
2007
13 years 5 months ago
2007
Many approaches have been taken in academic environments to address the problem of student and course timetabling. Typically, student scheduling and course scheduling have been tr...