3019 search results - page 338 / 604 » Approximating the Domatic Number |
155
click to vote
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
206
click to vote
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and co...
171
click to vote
SIGMETRICS
2003
ACM
15 years 12 months ago
2003
ACM
A recently proposed active queue management, CHOKe, aims to protect TCP from UDP flows. Simulations have shown that as UDP rate increases, its bandwidth share initially rises but...
161
click to vote
ESA
2003
Springer
15 years 12 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
141
click to vote
GLVLSI
2002
IEEE
15 years 11 months ago
2002
IEEE
— The high-order compact finite difference (HCFD) method is adapted for interconnect modeling. Based on the compact finite difference method, the HCFD method employs the Chebys...