18 search results - page 1 / 4 » Proving Positive Almost-Sure Termination |
RTA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
MSS
2010
IEEE
13 years 3 months ago
2010
IEEE
The yolk, defined by McKelvey as the smallest ball intersecting all median hyperplanes, is a key concept in the Euclidean spatial model of voting. Koehler conjectured that the yo...
IPL
1998
13 years 4 months ago
1998
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exis...
RSA
2011
12 years 11 months ago
2011
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
DCG
2000
13 years 4 months ago
2000
Points P1, . . . , Pn in the unit square define a convex n-chain if they are below y = x and, together with P0 = (0, 0) and Pn+1 = (1, 1), they are in convex position. Under unifo...