6142 search results - page 46 / 1229 » The Complexity of Partition Functions |
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
—Supporting quality of service (QoS) in large-scale broadband networks poses major challenges, due to the intrinsic complexity of the corresponding resource allocation problems. ...
JDA
2008
14 years 9 months ago
2008
Partitioning a permutation into a minimum number of monotone subsequences is NP-hard. We extend this complexity result
JEC
2006
14 years 9 months ago
2006
Modern digital systems consist of a complex mix of computational resources, e.g. microprocessors, memory elements and reconfigurable logic. System partitioning
167
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
The paper proposes an extension of CFDs [1], referred to as extended Conditional Functional Dependencies (eCFDs). In contrast to CFDs, eCFDs specify patterns of semantically relate...
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
Researchers are currently investigating applying benefit, or utility functions for allocating resources in limited, soft real time systems [1,2,3]. While the future of real -time ...