Recherche - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu

Filtrer vos résultats

317 résultats
keyword_s : Complexity
Page :
triés par
Image document

Dichotomy theorem for the generalized unique satisfiability problem

 Miki Hermann , Laurent Juban
[Intern report] 98-R-065 || hermann98b, 1998, 11 p
Rapport inria-00098730v1
Image document

Scheduling Pipelined Applications: Models, Algorithms and Complexity

 Anne Benoit
Computer Science [cs]. Ecole normale supérieure de lyon - ENS LYON, 2009
HDR tel-00404147v2

Dichotomy Theorem for the Generalized Unique Satisfiability Problem

 Laurent Juban
12th International Symposium on Fundamentals of Computation Theory - FCT'99, 1999, Iasi, Romania, pp.327-337
Communication dans un congrès inria-00099003v1
Image document

Some programming languages for LOGSPACE and PTIME

 Guillaume Bonfante
11th International Conference on Algebraic Methodology and Software Technology - AMAST'06, Jul 2006, Kuresaare/Estonie
Communication dans un congrès inria-00105744v1

Minimizing the weighted sum of machine completion times in flowshop with time lags

 Julien Fondrevelle , Ammar Oulamara , Marie-Claude Portmann
International Conference on Industrial Engineering and Systems Management - IESM'05, I4e2, May 2005, Marrakech/Maroc
Communication dans un congrès inria-00000148v1
Image document

Hierarchical Production Planning for General Jobs Shops : Part 2 : Evaluation and Application

 Anshu Mehra , Ioannis Minis , Jean-Marie Proth
[Research Report] RR-2634, INRIA. 1995, pp.34
Rapport inria-00074053v1
Image document

Hierarchical Production Planning for General Jobs Shops : Part 1 : Modeling

 Anshu Mehra , Ioannis Minis , Jean-Marie Proth
[Research Report] RR-2633, INRIA. 1995, pp.42
Rapport inria-00074054v1
Image document

Total Completion Time Scheduling Under Scenarios

 Thomas Bosman , Martijn van Ee , Ekin Ergen , Csanád Imreh , Alberto Marchetti-Spaccamela , et al.
WAOA 2023 - International Workshop on Approximation and Online Algorithms, 2023, Amsterdam, Netherlands. pp.104-118, ⟨10.1007/978-3-031-49815-2_8⟩
Communication dans un congrès hal-04385325v1

Exploring the complexity of the integer image problem in the max-algebra

 Marie Maccaig
Discrete Applied Mathematics, 2017, 217 (2), pp.261--275. ⟨10.1016/j.dam.2016.09.016⟩
Article dans une revue hal-01423520v1
Image document

comparison-based algorithms are robust and randomized algorithms are anytime.

 Sylvain Gelly , Sylvie Ruette , Olivier Teytaud
Evolutionary Computation, 2007
Article dans une revue inria-00173221v1
Image document

Computing Riemann-Roch spaces via Puiseux expansions

 Simon Abelard , Elena Berardini , Alain Couvreur , Grégoire Lecerf
Journal of Complexity, 2022, ⟨10.1016/j.jco.2022.101666⟩
Article dans une revue hal-03281757v2
Image document

Complexity analysis of random convex hulls

 Rémy Thomasse
Other [cs.OH]. Université Nice Sophia Antipolis, 2015. English. ⟨NNT : 2015NICE4116⟩
Thèse tel-01252937v2
Image document

Hiérarchies algébriques de classes d'automates cellulaires

 Marianne Delorme , Jacques Mazoyer , Guillaume Theyssier
[Rapport de recherche] LIp RR-2005-29, Laboratoire de l'informatique du parallélisme. 2005, 2+49p
Rapport hal-02102505v1
Image document

Unification modulo Lists with Reverse, Relation with Certain Word Equations

 Siva Anantharaman , Peter Hibbs , Paliath Narendran , Michaël Rusinowitch
CADE-27 - The 27th International Conference on Automated Deduction, Association for Automated Reasoning (AAR), Aug 2019, Natal, Brazil. pp.1--17, ⟨10.1007/978-3-030-29436-6_1⟩
Communication dans un congrès hal-02123709v1
Image document

Energy-aware scheduling under reliability and makespan constraints

 Guillaume Aupy , Anne Benoit , Yves Robert
[Research Report] RR-7757, INRIA. 2012, pp.25
Rapport inria-00630721v3
Image document

A probabilistic algorithm to compute the real dimension of a semi-algebraic set

 Mohab Safey El Din , Elias Tsigaridas
2013
Pré-publication, Document de travail hal-00808708v2
Image document

Résolution exacte de problèmes d'ordonnancement de type flowshop de permutation en présence de contraintes d'écarts temporels entre opérations

 Julien Fondrevelle
Autre [cs.OH]. Institut National Polytechnique de Lorraine - INPL, 2005. Français. ⟨NNT : ⟩
Thèse tel-00011065v1
Image document

Diameter-constrained network reliability : properties and computation

 Pablo Enrique Sartor del Giudice
Other [cs.OH]. Université de Rennes; Universidad de la República (Montevideo), 2013. English. ⟨NNT : 2013REN1S102⟩
Thèse tel-00945265v1
Image document

Diverse Routing with the star property

 Jean-Claude Bermond , David Coudert , Gianlorenzo d'Angelo , Fatima Zahra Moataz
[Research Report] RR-8071, INRIA. 2012
Rapport hal-00733869v1
Image document

Ordonnancement non préemptif et condition d'ordonnançabilité pour systèmes embarqués à contraintes temps réel

 Liliana Cucu
Autre [cs.OH]. Université Paris Sud - Paris XI, 2004. Français. ⟨NNT : ⟩
Thèse tel-00012046v1
Image document

Edge-labellings, vertex-colourings and combinatorial games on graphs

 Foivos-Sotirios Fioravantes
Discrete Mathematics [cs.DM]. Université Côte d'Azur, 2022. English. ⟨NNT : 2022COAZ4053⟩
Thèse tel-03827530v1
Image document

A polynomial algorithm for deciding the validity of an electrical distribution tree

 Dominique Barth , Thierry Mautor , Dimitri Watel , Marc-Antoine Weisser
Information Processing Letters, 2022, 176, pp.106249. ⟨10.1016/j.ipl.2022.106249⟩
Article dans une revue hal-04113551v1
Image document

A State-of-the-Art Survey of Due Date Assignment and Scheduling Research: Common Due Date

 Valery Gordon , Jean-Marie Proth , Chengbin Chu
[Research Report] RR-3454, INRIA. 1998, pp.36
Rapport inria-00073236v1

La visione riduttiva dell'economia nelle scienze sociali

 Francesco Magris , Antoine Parent
Intersezioni. Rivista di storia delle idee, 2016, 3, pp.407-432. ⟨10.1404/84828⟩
Article dans une revue halshs-01477259v1

The Random Bit Complexity of Mobile Robots Scattering

 Quentin Bramas , Sébastien Tixeuil
[Research Report] Université Pierre et Marie Curie. 2015
Rapport hal-00866048v2

Refined Analysis of the Asymptotic Complexity of the Number Field Sieve

 Aude Le Gluher , Pierre-Jean Spaenlehauer , Emmanuel Thomé
Mathematical Cryptology, 2021, 1 (1), pp.71-88. ⟨10.48550/arXiv.2007.02730⟩
Article dans une revue hal-02934273v1
Image document

Multiplication algorithms : bilinear complexity and fast asymptotic methods

 Svyatoslav Covanov
Symbolic Computation [cs.SC]. Université de Lorraine, 2018. English. ⟨NNT : 2018LORR0057⟩
Thèse tel-01825744v1
Image document

Petri Net Reachability Graphs: Decidability Status of FO Properties

 Philippe Darondeau , Stephane Demri , Roland Meyer , Christophe Morvan
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, IARCS, Dec 2011, Bombay, India
Communication dans un congrès inria-00627657v1
Image document

Scheduling periodic I/O access with bi-colored chains: models and algorithms

 Emmanuel Jeannot , Guillaume Pallez , Nicolas Vidal
Journal of Scheduling, In press, ⟨10.1007/s10951-021-00685-8⟩
Article dans une revue hal-03216844v1
Image document

Ceteris Paribus Structure in Logics of Game Forms (2013)

 Davide Grossi , Emiliano Lorini , François Schwarzentruber
Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2013), Jan 2013, Chennai, India. pp.1-11
Communication dans un congrès hal-01141938v2
Page :