493 search results - page 34 / 99 » Final exam scheduler - FES |
COMPSAC
2002
IEEE
15 years 2 months ago
2002
IEEE
A transactional workflow is composed of traditional flat transactions, and its execution has relaxed transactional atomicity. Due to different termination characteristics of trans...
ECAI
1998
Springer
15 years 1 months ago
1998
Springer
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...
78
Voted
IJCAI
2007
14 years 11 months ago
2007
This paper investigates how to represent and solve multiagent task scheduling as a Distributed Constraint Optimization Problem (DCOP). Recently multiagent researchers have adopted...
SIGMETRICS
1998
ACM
14 years 9 months ago
1998
ACM
Implicitcoscheduling is a distributed algorithm fortime-sharing communicating processes in a cluster of workstations. By observing and reacting to implicit information, local sche...
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
—Network coding for two-way relaying in a three-node network is considered. The achievable rate regions under both traditional four-slot multi-hopping (FSMH) and network coding (...