• ArXiv
• 2010
Given non-negative integers ni and αi with 0 ≤ αi ≤ ni (i = 1, 2, . . . , k), an [α1, α2, . . . , αk]-k-partite hypertournament on ∑k 1 ni vertices is a (k+ 1)-tuple (U1, U2, . . . , Uk, E), where Ui(More)
• Discrete Mathematics
• 2008
An (n, a, b)-perfect double cube is a b× b× b sized n-ary periodic array containing all possible a × a × a sized n-ary array exactly once as subarray. A growing cube is an array whose cj × cj × cj(More)
• ArXiv
• 2010
Let n (1 ≤ n) be an integer and X = [xij ]1≤i,j≤n be an n× n sized matrix of independent random variables having joint uniform distribution Pr{xij = k for 1 ≤ k ≤ n} = 1 n (1 ≤ i, j ≤ n). A(More)
• ArXiv
• 2010
Let ξ be a random integer vector, having uniform distribution P{ξ = (i1, i2, . . . , in) = 1/n} for 1 ≤ i1, i2, . . . , in ≤ n. A realization (i1, i2, . . . , in) of ξ is called good, if its elements(More)
• ArXiv
• 2010
Virtual memory of computers is usually implemented by demand paging. For some page replacement algorithms the number of page faults may increase as the number of page frames increases. Belady, Nelson(More)