2355 search results - page 32 / 471 » Scheduling in the Z-Polyhedral Model |
ANOR
2007
14 years 9 months ago
2007
This paper introduces a model for Distributed Employee Timetabling Problems (DisETPs) and proposes a general architecture for solving DisETPs by using a Multi Agent System (MAS) pa...
80
Voted
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...
127
click to vote
CONCUR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The technique of partial order reduction (POR) for probabilistic model checking prunes the state space of the model so that a maximizing scheduler and a minimizing one pe...
113
click to vote
CSCW
2011
ACM
14 years 4 months ago
2011
ACM
The performance of a collaborative system depends on how two mandatory collaborative tasks, processing and transmission of user commands, are scheduled. We have developed multiple...
91
Voted
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...