14 search results - page 3 / 3 » ipl 2011 |
IPL
2011
13 years 4 months ago
2011
Consider the following problem. Given n sets of sets A1, . . . , Au with elements over a universe E = {e1, . . . , en}, the goal is to select exactly one set from each of A1, . . ...
IPL
2011
13 years 4 months ago
2011
In this paper, we use the concept of edge-colored graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirement...
IPL
2011
13 years 4 months ago
2011
The segment minimization problem consists of representing an integer matrix as the sum of the fewest number of integer matrices each of which have the property that the non-zeroes...
IPL
2011
13 years 3 months ago
2011
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denot...