-
A maximum-likelihood framework for determining moving edges in image sequences
Disponible dans les fichiers attachés à ce document -
MSQL : A multidatabase language
This dataset has no description
-
Distributed system structuring using multi-functions
Disponible dans les fichiers attachés à ce document -
Variational approach of serial multi-level production/inventory systems
This dataset has no description
-
Explicit calculation of reactive flows with an upwind finite element hydrodyn...
Disponible dans les fichiers attachés à ce document -
An active stable storage and its integration in a multiprocessor architecture
Disponible dans les fichiers attachés à ce document -
Knowledge-based methodology in pattern recognition and understanding
The interpretation and understanding of complex patterns (e.g. speech, images or other kinds of mono- or multi-dimensional signals) is related both to pattern... -
Placement simultané en translation
Disponible dans les fichiers attachés à ce document -
Acyclic fork-join queueing networks
This dataset has no description
-
The fork-join queue and related systems with synchronization constraints: sto...
Résumé disponible dans les fichiers attachés -
Proving inductive equalities algorithms and implementation
The aim of this paper is first to describe an algorithm for testing sufficient completeness and second to present concepts necessary to understand the behavior of an... -
Revisiting Value Prediction
Value prediction was proposed in the mid 90's to enhance the performance of high-end microprocessors. Unfortunately, to the best of our knowledge, there are no Value... -
On termination of the direct sum of term rewriting systems
Some sufficient conditions are given for the termination of the direct sum of two term rewriting systems: either no right-hand-side of a rule is a variable, or no... -
On word problems in equational theories
The Knuth-Bendix procedure for word problems in universal algebra is known to be very effective when it is applicable. However, the procedure will fail if it generates... -
Termination of rewriting systems by polynomial interpretations and its implem...
This paper describes the actual implementation in the rewrite rule laboratory REVE, of an elementary procedure that checks inequalities between polynomials and is used... -
Decidability of the confluence of ground term rewriting systems
The aim of this paper is to propose a simple algorithm to decide the confluence of ground term rewriting systems. This algorithm is derived from decidability results... -
Improving basic narrowing techniques and commutation properties
In this paper, we propose a new and complete method based on narrowing for solving equations in equational theories. This method is complete in the sense that it gives... -
Shematization of infinite sets of rewrite rules. Applications to the divergen...
Infinite sets of rewrite rules may be generated by completion of term rewriting systems or by a narrowing process for solving equations in equational theories. This is... -
How to characterize the language of ground normal forms
Term rewriting systems provide the computer scientists with a language to express functional definitions on complex domains. In such an area, we face the problem to...
