Search

Search Results

1. Structures de données et méthodes formelles

   Ce livre porte sur l’étude des structures de données, à savoir des constituants logiciels dont la qualité conditionne le bon fonctionnement et...

   Marc Guyomard in Collection Télécom (ex-Collection technique et scientifique des télécommunications)

   Book 2011
   

2. Les virus informatiques: théorie, pratique et applications

   Cet ouvrage (2e édition actualisée et augmentée) présente les fondements théoriques de la virologie informatique, les aspects algorithmiques et...

   Éric Filiol in Collection IRIS

   Textbook 2009
   

3. Techniques virales avancées

   Cet ouvrage traite de techniques avancées de la virologie informatique selon une double perspective: l'analyse de la défense antivirale et les...

   Éric Filiol in Collection IRIS

   Book 2007
   

4. Enumération des 2-arbres k-gonaux

   In this paper1, we generalize 2-trees by replacing triangles by quadrilaterals, pentagons or k-sided polygons (k-gons), where k ≥ 3 is given. This...

   Gilbert Labelle, Cédric Lamathe, Pierre Leroux in Mathematics and Computer Science II

   Conference paper 2002
   

5. Apprentissage de Séquences Non-Indépendantes d’Exemples

   Beaucoup de travaux récent considérent les applications pratiques des réseaux neuronaux (ou d’autres algorithmes proches) pour la modélisation de...

   Olivier Teytaud in Mathematics and Computer Science II

   Conference paper 2002
   

6. Une introduction à Prolog III

   The Prolog III programming language extends Prolog by redefining the fundamental process at its heart; unification. Prolog III integrates into this...

   Alain Colmerauer in Foundations of Data Organization and Algorithms

   Conference paper 1989
   

7. Files d'attente exponentielles ayant des parametres non-stationnaires dans le temps

   There exist a large number of Queueing Systems having a non-stationary behavior. We call non-stationarity , random time-variations of some parameters...

   Catherine Rosenberg in Acta Informatica

   Article 01 May 1986

8. Bicentres de langages algébriques

   The notions of bicenter and strict bicenter of a language have been defined by A. De Luca, A. Restivo and S. Salemi and are a generalisation of the...

   J. M. Autebert, J. Beauquier, ... F. Gire in Acta Informatica

   Article 01 August 1984

9. Hiérarchie et fermeture de certaines classes de tag-systèmes

   We define sets of infinite words generated by various classes of tag-systems. We show that every infinite word generated by extended tag-system can...

   Jean-Jacques Pansiot in Acta Informatica

   Article 01 November 1983

10. Partage de tâches entre processeurs homogenes

    A method for task scheduling between two homogeneous interconnected processors is proposed. We assume that one of the processors is faster than the...

    Philippe Nain in Acta Informatica

    Article 01 January 1983

11. Formes de langages et de grammaires

    This paper is devoted to the study of context-free languages over infinite alphabets. This work can be viewed as a new attempt to study families of...

    Jean -Michel Autebert, Joffroy Beauquier, Luc Boasson in Acta Informatica

    Article 01 June 1982

12. Langages saturés et cônes décroissants langages et cônes bifidèles

    C (ℒ) (resp. C ^d (−), C ^f (−)) is the smallest family of languages containing ℒ and closed under morphism (resp. alphabetic morphism, non erasing...

    Jeannine Leguy in Acta Informatica

    Article 01 March 1982

13. Indépendance forte de certaines opérations

    Using properties of operations compelled by an operator introduced in [17, 19, 20] and technics developed in [12], we compare the operations of...

    F. Rodriguez in Acta Informatica

    Article 01 June 1981

14. Evaluation des performances d'un algorithme de contrôle de la cohérence d'une base de données répartie

    This article presents a performance evaluation of an algorithm preserving consistency in a duplicated data base. This algorithm was proposed by C.A....

    B. Plateau in Acta Informatica

    Article 01 June 1980

15. Sur les générateurs algébriques et linéaires

    We study some properties of algebraic and linear generators. We show that the algebraic language E generated by the grammar: S → aSbSc + d dominates...

    Michel Latteux in Acta Informatica

    Article 01 May 1980

16. Procédures de reprise dans les systèmes de gestion de base de données réparties

    In this paper, two recovery techniques used to restore the integrity of the distributed database management system operating in the presence of...

    P. Bouchet in Acta Informatica

    Article 01 December 1979

17. Analyse et optimisation d'une procédure de reprise dans un système de gestion de données centralisées

    We have investigated a transaction oriented computer system operating in the presence of intermittent failures. The system integrity is maintained by...

    N. Mikou, S. Tucci in Acta Informatica

    Article 01 November 1979

18. Intersections de langages algébriques bornés

    We study the family SLB of morphic images of the intersection of two bounded Context-free languages. In particular, we prove the equality between...

    Michel Latteux in Acta Informatica

    Article 01 September 1979

19. Opérations de cylindre et applications séquentielles gauches inverses

    In this paper, the relations between the principality of a family of languages as a cylinder and its principality as family closed under inverse gsm...

    Jean-Michel Autebert in Acta Informatica

    Article 01 September 1979

20. Monoïdes syntactiques des langages algébriques

    Syntactic monoids have been considered so far almost only for rational (= regular) languages. We start here a systematic study of the syntactic...

    J. -F. Perrot in Acta Informatica

    Article 01 December 1977