720 search results - page 93 / 144 » Broadcast scheduling: algorithms and complexity |
160
Voted
WSC
2008
15 years 8 months ago
2008
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
172
click to vote
ATAL
2009
Springer
16 years 20 days ago
2009
Springer
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
268
click to vote
ICS
2007
Tsinghua U.
16 years 7 days ago
2007
Tsinghua U.
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...
142
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
Deadlock detection scheduling is an important, yet oft-overlooked problem that can significantly affect the overall performance of deadlock handling. An excessive initiation of ...
157
click to vote
HPDC
1999
IEEE
15 years 10 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...