All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 15 Next

Displaying 281 – 300 of 305

Showing per page

On z -submonoids and z -codes

M. Madonia, S. Salemi, T. Sportelli (1991)

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

One-Rule Length-Preserving Rewrite Systems and Rational Transductions

Michel Latteux, Yves Roos (2014)

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

We address the problem to know whether the relation induced by a one-rule length-preserving rewrite system is rational. We partially answer to a conjecture of Éric Lilin who conjectured in 1991 that a one-rule length-preserving rewrite system is a rational transduction if and only if the left-hand side u and the right-hand side v of the rule of the system are not quasi-conjugate or are equal, that means if u and v are distinct, there do not exist words x, y and z such that u = xyz and v = zyx. We...

One-way communication complexity of symmetric boolean functions

Jan Arpe, Andreas Jakoby, Maciej Liśkiewicz (2005)

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

We study deterministic one-way communication complexity of functions with Hankel communication matrices. Some structural properties of such matrices are established and applied to the one-way two-party communication complexity of symmetric Boolean functions. It is shown that the number of required communication bits does not depend on the communication direction, provided that neither direction needs maximum complexity. Moreover, in order to obtain an optimal protocol, it is in any case sufficient...

One-way communication complexity of symmetric Boolean functions

Jan Arpe, Andreas Jakoby, Maciej Liśkiewicz (2010)

RAIRO - Theoretical Informatics and Applications

We study deterministic one-way communication complexity of functions with Hankel communication matrices. Some structural properties of such matrices are established and applied to the one-way two-party communication complexity of symmetric Boolean functions. It is shown that the number of required communication bits does not depend on the communication direction, provided that neither direction needs maximum complexity. Moreover, in order to obtain an optimal protocol, it is in any case sufficient...

On-line finite automata for addition in some numeration systems

Christiane Frougny (2010)

RAIRO - Theoretical Informatics and Applications

We consider numeration systems where the base is a negative integer, or a complex number which is a root of a negative integer. We give parallel algorithms for addition in these numeration systems, from which we derive on-line algorithms realized by finite automata. A general construction relating addition in base β and addition in base βm is given. Results on addition in base β = b m , where b is a relative integer, follow. We also show that addition in base the golden ratio is computable by an on-line...

Online LIB problems : heuristics for bin covering and lower bounds for bin packing

Luke Finlay, Prabhu Manyem (2005)

RAIRO - Operations Research - Recherche Opérationnelle

We consider the NP Hard problems of online Bin Covering and Packing while requiring that larger (or longer, in the one dimensional case) items be placed at the bottom of the bins, below smaller (or shorter) items — we call such a version, the LIB version of problems. Bin sizes can be uniform or variable. We look at computational studies for both the Best Fit and Harmonic Fit algorithms for uniform sized bin covering. The Best Fit heuristic for this version of the problem is introduced here. The...

Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing

Luke Finlay, Prabhu Manyem (2006)

RAIRO - Operations Research

We consider the NP Hard problems of online Bin Covering and Packing while requiring that larger (or longer, in the one dimensional case) items be placed at the bottom of the bins, below smaller (or shorter) items — we call such a version, the LIB version of problems. Bin sizes can be uniform or variable. We look at computational studies for both the Best Fit and Harmonic Fit algorithms for uniform sized bin covering. The Best Fit heuristic for this version of the problem is introduced here. The...

On-line models and algorithms for max independent set

Bruno Escoffier, Vangelis Th. Paschos (2006)

RAIRO - Operations Research

In on-line computation, the instance of the problem dealt is not entirely known from the beginning of the solution process, but it is revealed step-by-step. In this paper we deal with on-line independent set. On-line models studied until now for this problem suppose that the input graph is initially empty and revealed either vertex-by-vertex, or cluster-by-cluster. Here we present a new on-line model quite different to the ones already studied. It assumes that a superset of the final graph is initially...

Optimal edge ranking of complete bipartite graphs in polynomial time

Ruo-Wei Hung (2006)

Discussiones Mathematicae Graph Theory

An edge ranking of a graph is a labeling of edges using positive integers such that all paths connecting two edges with the same label visit an intermediate edge with a higher label. An edge ranking of a graph is optimal if the number of labels used is minimum among all edge rankings. As the problem of finding optimal edge rankings for general graphs is NP-hard [12], it is interesting to concentrate on special classes of graphs and find optimal edge rankings for them efficiently. Apart from trees...

Currently displaying 281 – 300 of 305