Řešení geometrických úloh při návrhu, vývoji a výrobě letounu
Reservation table scheduling: branch-and-bound based optimization vs. integer linear programming techniques
The recourse to operation research solutions has strongly increased the performances of scheduling task in the High-Level Synthesis (called hardware compilation). Scheduling a whole program is not possible as too many constraints and objectives interact. We decompose high-level scheduling in three steps. Step 1: Coarse-grain scheduling tries to exploit parallelism and locality of the whole program (in particular in loops, possibly imperfectly nested) with a rough view of the target architecture....
Résolution du problème de l'ellipse et du cercle par l'algorithme de Hörmander
Résolution du problème du multi-rendezvous à l'aide d'un modèle d'algorithme distribué
Resolution Methods in Proving the Program Correctness
Resolution of first- and second-order linear differential equations with periodic inputs by a computer algebra system.
Résolution systolique de systèmes linéaires denses
Restricted ideals and the groupability property. Tools for temporal reasoning
In the field of automatic proving, the study of the sets of prime implicants or implicates of a formula has proven to be very important. If we focus on non-classical logics and, in particular, on temporal logics, such study is useful even if it is restricted to the set of unitary implicants/implicates [P. Cordero, M. Enciso, and I. de Guzmán: Structure theorems for closed sets of implicates/implicants in temporal logic. (Lecture Notes in Artificial Intelligence 1695.) Springer–Verlag, Berlin 1999]....
Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
Branching programs are a well established computation model for Boolean functions, especially read-once branching programs have been studied intensively. In this paper the expressive power of nondeterministic read-once branching programs, more precisely the class of functions representable in polynomial size, is investigated. For that reason two restricted models of nondeterministic read-once branching programs are defined and a lower bound method is presented. Furthermore, the first exponential...
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Branching programs are a well established computation model for Boolean functions, especially read-once branching programs have been studied intensively. In this paper the expressive power of nondeterministic read-once branching programs, more precisely the class of functions representable in polynomial size, is investigated. For that reason two restricted models of nondeterministic read-once branching programs are defined and a lower bound method is presented. Furthermore, the first exponential...
Restricted permutations from Catalan to Fine and back.
Résultats de complétude pour des classes de types du système
ReSySTER: A hybrid recommender system for Scrum team roles based on fuzzy and rough sets
Agile development is a crucial issue within software engineering because one of the goals of any project leader is to increase the speed and flexibility in the development of new commercial products. In this sense, project managers must find the best resource configuration for each of the work packages necessary for the management of software development processes in order to keep the team motivated and committed to the project and to improve productivity and quality. This paper presents ReSySTER,...
Rétractions et interprétation interne du polymorphisme : le problème de la rétraction universelle
Retracts of free monoids are nowhere dense with respect to finite group topologies and p-adic topologies.
Retrieving library functions by unifying types modulo linear isomorphism
Return words in sturmian and episturmian words
Return words in Sturmian and episturmian words
Considering each occurrence of a word w in a recurrent infinite word, we define the set of return words of w to be the set of all distinct words beginning with an occurrence of w and ending exactly just before the next occurrence of w in the infinite word. We give a simpler proof of the recent result (of the second author) that an infinite word is Sturmian if and only if each of its factors has exactly two return words in it. Then, considering episturmian infinite words, which are a natural generalization...
Returning and non-returning parallel communicating finite automata are equivalent
A parallel communicating automata system consists of several automata working independently in parallel and communicating with each other by request with the aim of recognizing a word. Rather surprisingly, returning parallel communicating finite automata systems are equivalent to the non-returning variants. We show this result by proving the equivalence of both with multihead finite automata. Some open problems are finally formulated.
Reversal distance for strings with duplicates: linear time approximation using hitting set.