Sciweavers

4797 search results - page 217 / 960
» The complexity of partition tasks
Sort
View
TCAD
2010
168views more  TCAD 2010»
15 years 1 months ago
An MILP-Based Performance Analysis Technique for Non-Preemptive Multitasking MPSoC
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
Hoeseok Yang, Sungchan Kim, Soonhoi Ha
RTCSA
2008
IEEE
16 years 27 days ago
Maximizing the Fault Tolerance Capability of Fixed Priority Schedules
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
Radu Dobrin, Hüseyin Aysan, Sasikumar Punnekk...
MAAMAW
1993
Springer
15 years 10 months ago
Coalition Formation Among Autonomous Agents
Autonomous agents working in multi-agent environments may need to cooperate in order to ful ll tasks. Given a set of agents and a set of tasks which they have to satisfy, we consi...
Steven P. Ketchpel
WICSA
2007
15 years 7 months ago
Architectural Misalignment: An Experience Report
It has been well documented that there is a correlation between the structure of an architecture and the organization that produces it. More concretely there is a correlation betw...
Matthew Bass, Vesna Mikulovic, Len Bass, James D. ...
BCS
2008
15 years 8 months ago
Fast Estimation of Nonparametric Kernel Density Through PDDP, and its Application in Texture Synthesis
In this work, a new algorithm is proposed for fast estimation of nonparametric multivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data s...
Arnab Sinha, Sumana Gupta