1729 search results - page 291 / 346 » On Bounds for the k-Partitioning of Graphs |
102
click to vote
ICDCIT
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Statically estimating the worst case execution time of a program is important for real-time embedded software. This is difficult even in the programming language level du...
WEA
2005
Springer
15 years 3 months ago
2005
Springer
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze c...
IWPEC
2004
Springer
15 years 3 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
WAOA
2004
Springer
15 years 3 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
DATE
2003
IEEE
15 years 3 months ago
2003
IEEE
We present a high-level synthesis algorithm solving the combined scheduling, allocation and binding problem minimizing area under both latency and maximum power per clock-cycle co...