Page 1 Next

Displaying 1 – 20 of 67

Showing per page

A distributed transportation simplex applied to a Content Distribution Network problem

Rafaelli de C. Coutinho, Lúcia M. A. Drummond, Yuri Frota (2014)

RAIRO - Operations Research - Recherche Opérationnelle

A Content Distribution Network (CDN) can be defined as an overlay system that replicates copies of contents at multiple points of a network, close to the final users, with the objective of improving data access. CDN technology is widely used for the distribution of large-sized contents, like in video streaming. In this paper we address the problem of finding the best server for each customer request in CDNs, in order to minimize the overall cost. We consider the problem as a transportation problem...

A Hajós type result on factoring finite abelian groups by subsets. II

Keresztély Corrádi, Sándor Szabó (2010)

Commentationes Mathematicae Universitatis Carolinae

It is proved that if a finite abelian group is factored into a direct product of lacunary cyclic subsets, then at least one of the factors must be periodic. This result generalizes Hajós's factorization theorem.

A note on domination in bipartite graphs

Tobias Gerlach, Jochen Harant (2002)

Discussiones Mathematicae Graph Theory

DOMINATING SET remains NP-complete even when instances are restricted to bipartite graphs, however, in this case VERTEX COVER is solvable in polynomial time. Consequences to VECTOR DOMINATING SET as a generalization of both are discussed.

An exercise on Fibonacci representations

Jean Berstel (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We give a partial answer to a question of Carlitz asking for a closed formula for the number of distinct representations of an integer in the Fibonacci base.

An Exercise on Fibonacci Representations

Jean Berstel (2010)

RAIRO - Theoretical Informatics and Applications

We give a partial answer to a question of Carlitz asking for a closed formula for the number of distinct representations of an integer in the Fibonacci base.

Block distribution in random strings

Peter J. Grabner (1993)

Annales de l'institut Fourier

For almost all infinite binary sequences of Bernoulli trials ( p , q ) the frequency of blocks of length k ( N ) in the first N terms tends asymptotically to the probability of the blocks, if k ( N ) increases like log 1 p N - log 1 p N - ψ ( N ) (for p q ) where ψ ( N ) tends to + . This generalizes a result due to P. Flajolet, P. Kirschenhofer and R.F. Tichy concerning the case p = q = 1 2 .

Cycle and path embedding on 5-ary N-cubes

Tsong-Jie Lin, Sun-Yuan Hsieh, Hui-Ling Huang (2009)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We study two topological properties of the 5-ary n -cube Q n 5 . Given two arbitrary distinct nodes x and y in Q n 5 , we prove that there exists an x - y path of every length ranging from 2 n to 5 n - 1 , where n 2 . Based on this result, we prove that Q n 5 is 5-edge-pancyclic by showing that every edge in Q n 5 lies on a cycle of every length ranging from 5 to 5 n .

Currently displaying 1 – 20 of 67

Page 1 Next