2283 search results - page 347 / 457 » Bounds of Graph Characteristics |
141
click to vote
WEA
2005
Springer
15 years 11 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...
171
click to vote
IWPEC
2004
Springer
15 years 11 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...
132
click to vote
WAOA
2004
Springer
15 years 11 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...
148
click to vote
DATE
2003
IEEE
15 years 11 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...
159
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...