2314 search results - page 125 / 463 » Minimal Partitions of a Graph |
114
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
117
click to vote
DAM
2008
15 years 3 months ago
2008
In this paper characterizations of connected unicyclic and bicyclic graphs in terms of the degree sequence, as well as the graphs in these classes minimal with respect to the degr...
134
click to vote
CODES
2009
IEEE
15 years 10 months ago
2009
IEEE
Kahn Process Networks is an appealing model of computation for programming and mapping applications onto multi-processor platforms. Autonomous processes communicate through unboun...
138
click to vote
IEEEARES
2007
IEEE
15 years 10 months ago
2007
IEEE
— The current standard for Fault-Tolerance in the Common Object Request Broker Architecture (CORBA) does not support network partitioning. However, distributed systems, and those...
168
click to vote
DFT
2005
IEEE
15 years 5 months ago
2005
IEEE
A built-in self-test (BIST) scheme is presented which both reduces overhead for detecting random-pattern-resistant (r.p.r.) faults as well as reduces power consumption during test...