7840 search results - page 163 / 1568 » On generalized Ramsey numbers |
94
Voted
DEDS
2007
15 years 21 days ago
2007
This paper presents a general framework for efficient synthesis of supervisors for discrete event systems. The approach is based on compositional minimisation, using concepts of p...
106
Voted
SYNTHESE
2008
15 years 19 days ago
2008
A Zenonian supertask involving an infinite number of identical colliding balls is generalized to include balls with different masses. Under the restriction that the total mass of a...
99
Voted
TIT
2008
15 years 19 days ago
2008
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
AUTOMATICA
2002
15 years 18 days ago
2002
In this note, the problem of minimal-order stabilization in the case where the plant is minimum phase is studied. A low bound on the order of stabilizers is derived and a set of m...
125
click to vote
DM
2002
15 years 16 days ago
2002
Let G be a tree and let H be a collection of subgraphs of G, each having at most d connected components. Let (H) denote the maximum number of members of H no two of which share a ...