7796 search results - page 154 / 1560 » On Generalized Schur Numbers |
153
click to vote
CPC
2006
15 years 6 months ago
2006
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...
159
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— This work considers the problem of transmitting multiple compressible sources over a network with minimum cost. The problem is complicated by the fact that the description of t...
180
click to vote
CPC
2007
15 years 6 months ago
2007
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...
174
click to vote
DEDS
2007
15 years 6 months 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...
170
click to vote
SYNTHESE
2008
15 years 6 months 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...