1205 search results - page 119 / 241 » On P Systems with Bounded Parallelism |
138
Voted
ECRTS
2006
IEEE
15 years 9 months ago
2006
IEEE
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduli...
134
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
— For an Estimation Based Multiple Model Switched Adaptive Control (EMMSAC) algorithm controlling a MIMO minimal LTI plant, lp, 1 ≤ p ≤ ∞ bounds on the gain from the input ...
130
Voted
IPL
2002
15 years 3 months ago
2002
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
162
Voted
ICNS
2006
IEEE
15 years 9 months ago
2006
IEEE
– Service-Oriented Programming Model is a new methodology for building service-oriented applications. In the Service-Oriented Programming Model, an application is assembled from ...
140
Voted
DATE
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper we present a new technique which exploits timing-correlation between tasks for scheduling analysis in multiprocessor and distributed systems with tree-shaped task-de...