1. Recherche
1935 résultats  enregistrer la recherche
...
halshs-00950109v1  Article dans une revue
Michel Grabisch, Peter Sudhölter. On the restricted cores and the bounded core of games on distributive lattices
European Journal of Operational Research, Elsevier, 2014, 235 (3), pp.709-717. 〈10.1016/j.ejor.2013.10.027〉
...
inria-00450684v2  Article dans une revue
Jens Gustedt, Hari Raghavan, Pedro Schimit. Exploring the random genesis of co-occurrence graphs
Physica A: Statistical Mechanics and its Applications, Elsevier, 2011, 390, pp.1516 - 1528. 〈10.1016/j.physa.2010.12.036〉
hal-01100197v1  Communication dans un congrès
Jean-Pierre Tillich, Audrey Tixier, Nicolas Sendrier. Reconstruction de la permutation d'un turbo-code
Journées codage et cryptographie 2014, Mar 2014, Les sept Laux, France
...
hal-01152353v1  Communication dans un congrès
Didier El Baz, Mhand Hifi, Toufik Saadi. Peer-to-peer solution of 2D cutting stocks problems
Andreas Brieden et al. 11th Cologne - Twente International Workshop on on Graphs and Combinatorial Optimization, May 2012, Munich, Germany. pp.116-120, 2012
hal-00152880v1  Communication dans un congrès
Didier El Baz, Moussa Elkihel, Laurent Gély, Gérard Plateau. Improved time and space complexity for Kianfar's inequality rotation algorithm
META'06, Workshop" Métaheuristiques : de la théorie aux applications", Nov 2006, Hammamet, Tunisia. 2006
...
inria-00602079v1  Rapport
Pierre Aboulker, Frédéric Havet, Nicolas Trotignon. On wheel-free graphs
[Research Report] RR-7651, INRIA. 2011
...
hal-01301966v1  Article dans une revue
Yongchao Xu, Edwin Carlinet, Thierry Géraud, Laurent Najman. Hierarchical Segmentation Using Tree-Based Shape Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence, Institute of Electrical and Electronics Engineers, 2017, 39 (3), pp.457-469. 〈10.1109/TPAMI.2016.2554550〉
...
hal-01152352v1  Article dans une revue
Vincent Boyer, Didier El Baz, Moussa Elkihel. A dynamic programming method with lists for the knapsack sharing problem
Computers and Industrial Engineering, Elsevier, 2011, 61 (2), pp.274-278. 〈10.1016/j.cie.2010.10.015〉
...
inria-00602188v1  Rapport
Stéphane Bessy, Frédéric Havet. Enumerating the edge-colourings and total colourings of a regular graph
[Research Report] RR-7652, INRIA. 2011
hal-00152860v1  Communication dans un congrès
Cyril Banderier. Average queue length and area below lattice paths
AofA'2006, Jul 2006, France. 2006
...
hal-01152475v1  Communication dans un congrès
Moussa Elkihel, Didier El Baz. Load balancing in a parallel dynamic programming multi-method applied to the 0-1 knapsack problem
IEEE CPS. 14th International Conference on Parallel, Distributed and network based Processing, Feb 2006, Montbéliard, France. pp. 127-132
...
hal-00452752v1  Communication dans un congrès
Frédérique Bassino, Laura Giambruno, Cyril Nicaud. The average state complexity of the star of a finite set of words is linear.
International Conference on Developments in Language Theory, 2008, Japan. 5257, pp.134-145, 2008
...
hal-00452754v1  Communication dans un congrès
Frédérique Bassino, Julien David, Cyril Nicaud. Random generation of possibly incomplete deterministic automata.
Génération Aléatoire de Structures COMbinatoires, 2008, Italy. pp.31-40, 2008
...
hal-01302377v1  Chapitre d'ouvrage
Michel Grabisch. Fuzzy Measures and Integrals: Recent Developments
D. E. Tamir and D. Rishe and A. Kande. Fifty Years of Fuzzy Logic and its Applications, 2015, 〈10.1007/978-3-319-19683-1_8〉
...
hal-00402807v1  Article dans une revue
Hervé Hocquard, Mickaël Montassier. Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
Information Processing Letters, Elsevier, 2009
...
hal-00452748v1  Article dans une revue
Frédérique Bassino, Julien David, Cyril Nicaud. Enumeration and random generation of possibly incomplete deterministic automata.
Pure Mathematics and Applications, 2008, 19 (2-3), pp.1-16
...
hal-00452749v1  Article dans une revue
Frédérique Bassino, Julien David, Cyril Nicaud. Average Case Analysis of Moore's State Minimization Algorithm.
Algorithmica, Springer Verlag, 2012, 63 (1-2), pp.509-531. 〈10.1007/s00453-011-9557-7〉
...
hal-01152683v1  Communication dans un congrès
Vincent Boyer, Didier El Baz, Moussa Elkihel. Dense Dynamic Programming on Multi GPU
IEEE CPS. 19th International Conference on Parallel, Distributed and networked-based Processing, Feb 2011, Ayia Napa, Cyprus. pp.545-551, 2011, 〈10.1109/PDP.2011.25〉
lirmm-00904544v1  Communication dans un congrès
Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos. An edge variant of the Erdős-Pósa property
ICGT: International Colloquium on Graph Theory and Combinatorics, Jun 2014, Grenoble, France. 2014
...
hal-00016378v1  Article dans une revue
Dominique Rossin, Robert Cori, Bruno Salvy. Polynomial Ideals for Sandpiles and their Grobner Bases
Theoretical Computer Science, Elsevier, 2002, 276, 1-2, pp.1--15
...
hal-01302376v1  Chapitre d'ouvrage
Michel Grabisch. Bases and Transforms of Set Functions
S. Saminger-Platz and R. Mesiar. On Logical, Algebraic and Probabilistic Aspects of Fuzzy Set Theory, 2016, 〈10.1007/978-3-319-28808-6_13〉
...
hal-00652574v1  Article dans une revue
Cédric Joncour, Arnaud Pêcher. Consecutive ones matrices for multi-dimensional orthogonal packing problems
Journal of Mathematical Modelling and Algorithms, Springer Verlag, 2012, Journal of Mathematical Modelling and Algorithm, 11 (1), pp.23-44. 〈10.1007/s10852-011-9167-z〉
...
hal-00803233v1  Article dans une revue
Michel Grabisch. The core of games on ordered structures and graphs
Annals of Operations Research, Springer Verlag, 2013, 204 (1), pp.33-64. 〈10.1007/s10479-012-1265-4〉
...
hal-01222193v3  Article dans une revue
Jonathan Chappelon, Leonardo Martínez-Sandoval, Luis Montejano, Luis Pedro Montejano, Jorge Luis Ramírez Alfonsín. Complete Kneser Transversals
Advances in Applied Mathematics, Elsevier, 2017, 82, pp.83-101. 〈10.1016/j.aam.2016.07.004〉
...
hal-00016679v1  Article dans une revue
Florence Levé, Gwenaël Richomme. Quasiperiodic Sturmian words and morphisms
Theoretical Computer Science, Elsevier, 2007, 372 (1), pp.15-25

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD