4797 search results - page 135 / 960 » The complexity of partition tasks |
176
click to vote
RTAS
2008
IEEE
16 years 21 days ago
2008
IEEE
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...
178
click to vote
FCS
2007
15 years 7 months ago
2007
In many task-planning domains, dynamic assemblies of autonomous agents are replacing hierarchical organisations because they promise more agility. In such assemblies, interdepende...
165
click to vote
IROS
2009
IEEE
16 years 29 days ago
2009
IEEE
Abstract— Previous work [1] shows that the movement representation in task spaces offers many advantages for learning object-related and goal-directed movement tasks through imit...
199
click to vote
RTAS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—Recent results have shown that the feasibility problem of scheduling periodic tasks with self-suspensions is NPhard in the strong sense. We observe that a variation of t...
171
click to vote
ICIP
2008
IEEE
16 years 8 months ago
2008
IEEE
The allowable computational complexity of video encoding is limited in a power-constrained system. Different video frames are associated with different motions and contexts, and s...