1536 search results - page 135 / 308 » DPS - Dynamic Parallel Schedules |
137
click to vote
ICPP
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
110
Voted
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
135
click to vote
PPSN
2004
Springer
15 years 8 months ago
2004
Springer
Two ideas taken from Bayesian optimization and classifier systems are presented for personnel scheduling based on choosing a suitable scheduling rule from a set for each person’s...
113
click to vote
ISORC
2000
IEEE
15 years 7 months ago
2000
IEEE
This paper deals with tolerance to timing faults in time-constrained systems. TAFT (Time Aware Fault-Tolerant) is a recently devised approach which applies tolerance to timing vio...
126
Voted
PODC
1999
ACM
15 years 7 months ago
1999
ACM
d Abstract) James H. Anderson Department of Computer Science University of North Carolina at Chapel Hill Mark Moiry Department of Computer Science University of Pittsburgh We cons...