Sciweavers

4797 search results - page 38 / 960
» The complexity of partition tasks
Sort
View
EURODAC
1995
IEEE
117views VHDL» more  EURODAC 1995»
14 years 11 days ago
Performance-complexity analysis in hardware-software codesign for real-time systems
The paper presents an approach for performance and complexity analysis of hardware/software implementations for real-time systems on every stage of the partitioning. There are two...
Victor V. Toporkov
DATE
2009
IEEE
115views Hardware» more  DATE 2009»
14 years 3 months ago
Response-time analysis of arbitrarily activated tasks in multiprocessor systems with shared resources
—As multiprocessor systems are increasingly used in real-time environments, scheduling and synchronization analysis of these platforms receive growing attention. However, most kn...
Mircea Negrean, Simon Schliecker, Rolf Ernst
COMPLEXITY
2004
69views more  COMPLEXITY 2004»
13 years 8 months ago
Mathematical models for explaining the emergence of specialization in performing tasks
In an evolving community consisting of many individuals, it is often the case that the individuals tend, over time, to become more specialized in performing the tasks necessary fo...
Daniel Solow, Joesph Szmerekovsky
INFOCOM
2002
IEEE
14 years 1 months ago
A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast
—Supporting quality of service (QoS) in large-scale broadband networks poses major challenges, due to the intrinsic complexity of the corresponding resource allocation problems. ...
Ariel Orda, Alexander Sprintson
JDA
2008
67views more  JDA 2008»
13 years 8 months ago
On minimum k-modal partitions of permutations
Partitioning a permutation into a minimum number of monotone subsequences is NP-hard. We extend this complexity result
Gabriele Di Stefano, Stefan Krause, Marco E. L&uum...