270 search results - page 20 / 54 » Partitioning into Sets of Bounded Cardinality |
ENDM
2007
13 years 8 months ago
2007
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
APAL
2006
13 years 8 months ago
2006
We present a technique for destroying stationary subsets of P+ using partial square sequences. We combine this method with Gitik's poset for changing the cofinality of a cardi...
ECRTS
2007
IEEE
14 years 3 months ago
2007
IEEE
This paper investigates resource allocation policies for achieving real-time content distribution with subsecond delay bounds on the current Internet. Resource allocation in real-...
DM
2008
13 years 8 months ago
2008
Let G = (V, E) be a graph. A set S V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V - S is adjacent to a vertex in V - S....
DAC
1996
ACM
14 years 28 days ago
1996
ACM
Abstract -- This paper introduces a new HW/SW partitioning algorithm used in automating the instruction set processor design for pipelined ASIP (Application Specific Integrated Pro...