3731 search results - page 136 / 747 » cases 2006 |
158
click to vote
IJIEM
2007
15 years 6 months ago
2007
: A service contract typically specifies the service level, i.e., the quality parameters of the service to be performed. In addition to this static part, there is also the need to ...
164
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
Let An denote the number of objects of some type of "size" n, and let Cn denote the number of these objects which are connected. It is often the case that there is a rel...
157
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...
146
click to vote
COMBINATORICS
2002
15 years 6 months ago
2002
An efficient and purely combinatorial algorithm for calculating products in arbitrary Coxeter groups is presented, which combines ideas of Fokko du Cloux and myself. Proofs are lar...
113
click to vote
COMBINATORICS
2002
15 years 6 months ago
2002
We give a generalization for the Deza-Frankl-Singhi Theorem in case of multiple intersections. More exactly, we prove, that if H is a set-system, which satisfies that for some k, ...