373 search results - page 26 / 75 » Scheduling Conditional Task Graphs |
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
In sequence modeling, we often wish to represent complex interaction between labels, such as when performing multiple, cascaded labeling tasks on the same sequence, or when longra...
107
click to vote
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
RTS
2008
14 years 9 months ago
2008
Abstract The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient tests are derived for feasibility analysis of a collection of sporadic jobs where ...
81
Voted
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...