Publications du pôle COMRED
ARTICLES AVEC COMITÉ DE LECTURE
S. Alouf, F. Huet, P. Nain
Forwarders vs. centralized server: an evaluation of two approaches for locating mobile agentsPerformance Evaluation, 49(1-4), pp.299-319, 09/2002,
hal-00641265B. Amedro, D. Caromel, F. Huet, V. Bodnartchouk, C. Delbé, G. L. Taboada
HPC in Java: Experiences in Implementing the NAS Parallel BenchmarksAPPLIED INFORMATICS AND COMMUNICATIONS, 22/08/2010,
inria-00504630O. Amini, D. Peleg, S. Pérennes, I. Sau, S. Saurabh
On the approximability of some degree-constrained subgraph problemsDiscrete Applied Mathematics, 160(2), pp.1661-1679, 01/08/2012,
lirmm-00736702O. Amini, F. Giroire, F. Huc, S. Pérennes
Minimal selectors and fault tolerant networksNetworks, 55(4), pp.326-340, 2010,
inria-00485848O. Amini, F. Havet, F. Huc, S. Thomassé
WDM and Directed Star ArboricityCombinatorics Probability & Computing, 19 pp.161-182, 2010,
lirmm-00512776O. Amini, F. Mazoit, N. Nisse, S. Thomassé
Submodular Partition FunctionsDiscrete Mathematics, 309 pp.6000-6008, 2009,
lirmm-00432698O. Amini, F. Mazoit, N. Nisse, S. Thomassé
Submodular Partition FunctionsDiscrete Mathematics, 309(20), pp.6000-6008, 2009,
hal-00414326C. André, F. Mallet
Modèle de contraintes temporelles pour systèmes polychronesJournal Européen des Systèmes Automatisés, 7-9(43), pp.725-739, 30/06/2009,
inria-00434462C. André, F. Mallet
Les modèles de temps de MARTE et CCSLGénie logiciel, (89), pp.44-49, 06/2009,
inria-00416597J. Araujo, V. Campos, F. Giroire, N. Nisse, L. Sampaio, R. Soares
On the hull number of some graph classesTheoretical Computer Science, 04/01/2013,
hal-00770650J. Araujo, J.-C. Bermond, F. Giroire, F. Havet, D. Mazauric, R. Modrzejewski
Weighted improper colouringJournal of Discrete Algorithms, 16 pp.53-66, 2012,
hal-00747755J. Araujo, N. Cohen, F. Giroire, F. Havet
Good edge-labelling of graphs.Discrete Applied Mathematics, 160(18), pp.2502-2513, 2012,
inria-00639005M. Aste, F. Havet, C. Linhares Sales
Grundy number and products of graphsDiscrete Mathematics, 310(9), pp.1482--1490, 2010,
inria-00496038J. Bang-Jensen, F. Havet, N. Trotignon
Finding an induced subdivision of a digraph.Theoretical Computer Science, 443 pp.10--24, 2012,
hal-00749187J. Bang-Jensen, F. Havet, N. Trotignon
Finding an induced subdivision of a digraphTheoretical Computer Science, 443 pp.10-24, 2012,
hal-00757430L. Barrière, P. Flocchini, F. V. Fomin, P. Fraigniaud, N. Nisse, N. Santoro, D. M. Thilikos
Connected Graph SearchingInformation and Computation, 219 pp.1-16, 2012,
hal-00741948D. Barth, P. Berthomé, M. Diallo, A. Ferreira
Revisiting Parametric Multi-Terminal Problems: Maximum Flows, Minimum Cuts and Cut-tree ComputationsDiscrete Optimization, 3 (3) pp.195-205, 09/2006,
hal-00126010M. Basavaraju, L. S. Chandran, N. Cohen, F. Havet, T. Müller
Acyclic edge-coloring of planar graphsSiam Journal on Discrete Mathematics, 25(2), pp.436--478, 2011,
inria-00638448F. Baude, D. Caromel, C. Dalmasso, M. Danelutto, V. Getov, L. Henrio, C. Pérez
GCM: A Grid Extension to Fractal for Autonomous Distributed ComponentsAnnales des Télécommunications, 2008,
inria-00323919F. Baude, D. Caromel, M. Leyton
File transfer in Grid applications at Deployment, Execution and RetrievalMultiagent and Grid Systems, 3(4), pp.381-391, 2007,
hal-00688655N. Ben Ali, A. Belghith, J. Moulierac, M. Molnár
QoS multicast aggregation under multiple additive constraintsComputer Communications, 17/06/2008,
inria-00425224J.-C. Bermond, J. Moulierac
Internet et la théorie des graphesTextes et documents pour la classe, 1042 pp.32-33, 10/2012,
hal-00747752J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau, F. Solano Donado
GMPLS Label Space Minimization through Hypergraph LayoutsTheoretical Computer Science, 444 pp.3-16, 27/07/2012,
hal-00706260J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau, F. Solano Donado
GMPLS label space minimization through hypergraph layoutsTheoretical Computer Science, 444 pp.3-16, 01/07/2012,
lirmm-00736508J.-C. Bermond, F. Havet, F. Huc, C. Linhares Sales
Improper colouring of weighted grid and hexagonal graphsDiscrete Mathematics, Algorithms and Applications (DMAA)., 2(3), pp.395–411, 2010,
inria-00526530J.-C. Bermond, D. Coudert, B. Lévêque
Approximations for All-to-all Uniform Traffic Grooming on Unidirectional RingJournal of Interconnection Networks, 9(4), pp.471-486, 2008,
inria-00429217J.-C. Bermond, A. Ferreira, S. Pérennes, J. Peters
Neighbourhood Broadcasting in HypercubesSIAM Journal on Discrete Mathematics, 21(4), pp.823-843, 2007,
hal-00429191J.-C. Bermond, L. Braud, D. Coudert
Traffic Grooming on the PathTheoretical Computer Science, 384(2-3), pp.139-151, 2007,
inria-00308716J.-C. Bermond, F. Havet, C. Toth
Fault tolerant on board networks with prioritiesNetworks, 47(1), pp.9-25, 2006,
inria-00430156J.-C. Bermond, J. Galtier, R. Klasing, N. Morales, S. Pérennes
Hardness and approximation of Gathering in static radio networksParallel Processing Letters, 16(2), pp.165-183, 2006,
inria-00430158J.-C. Bermond, C. J. Colbourn, D. Coudert, G. Ge, A. C. H. Ling, X. Munoz
Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6SIAM Journal on Discrete Mathematics, 19(2), pp.523-542, 2005,
inria-00429214J.-C. Bermond, D. Coudert, M.-L. Yu
On DRC-covering of Kn by cyclesJournal of Combinatorial Designs, 11(2), pp.100 - 112, 2003,
inria-00429205J.-C. Bermond, E. Darrot, O. Delmas, S. Pérennes
Hamilton circuits in the directed wrapped Butterfly networkDiscrete Applied Mathematics, 84(1-3), pp.21-42, 15/05/1998,
hal-00407356J.-C. Bermond, E. Darrot, O. Delmas, S. Pérennes
Hamilton Cycle Decomposition of the Butterfly NetworkParallel Processing Letters, 8(3), pp.371-385, 1998,
hal-00407366S. Bessy, F. Havet
Enumerating the edge-colourings and total colourings of a regular graphJournal of Combinatorial Optimization, 25(4), pp.523-535, 2013,
hal-00821598S. Bessy, E. Birmele, F. Havet
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree.Journal of Graph Theory, 53(4), pp.315-332, 2006,
lirmm-00153978L. Blin, P. Fraigniaud, N. Nisse, S. Vial
Distributed Chasing of Network Intruders by Mobile Agents.Theoretical Computer Science, 399 pp.12--37, 2008,
hal-00341368J. Boucaron, A. Coadou, R. De Simone
Latency-Insensitive Design: Retry Relay-Station and Fusion ShellElectronic Notes in Theoretical Computer Science, 24503/08/2009,
inria-00483253C. Caillouet, S. Pérennes, H. Rivano
Framework for Optimizing the Capacity of Wireless Mesh NetworksComputer Communications, 34(13), pp.1645-1659, 08/2011,
inria-00572967V. Campos, A. Gyarfas, F. Havet, C. Linhares Sales, F. Maffray
New bounds on the Grundy number of products of graphsJournal of Graph Theory, 71(1), pp.78--88, 2012,
hal-00749190I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, H. Rivano
Fractional Path Coloring in Bounded Degree Trees with ApplicationsAlgorithmica, 58(2), pp.516-540, 2010,
hal-00371052I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, P. Persiano, H. Rivano
Approximate Constrained Bipartite Edge ColoringDiscrete Applied Mathematics, 143(1-3), pp.54--61, 2004,
hal-00371101D. Caromel, A. Di Costanzo, C. Delbe
Peer-to-Peer and Fault-tolerance: Towards Deployment-based Technical ServicesFuture Generation Computer Systems, pp.FGCS-D-06-00155, 2007,
hal-00128505D. Caromel, A. Di Costanzo, C. Mathieu
Peer-to-Peer for Computational Grids: Mixing Clusters and Desktop MachinesParallel Computing, pp.Special issue for Large Scale Grid, 2007,
hal-00125041D. Caromel, G. Chazarain, L. Henrio
Garbage Collecting the Grid: A Complete DGC for ActivitiesMiddleware 2007, LNCS 4834, 2007,
inria-00180150D. Caromel, C. Delbe, A. Di Costanzo, M. Leyton
ProActive: an Integrated platform for programming and running applications on grids and P2P systemsComputational Methods in Science and Technology, 12 pp.issue 1, 2006,
hal-00125034J. Chalopin, V. Chepoi, N. Nisse, Y. Vaxès
Cop and robber games when the robber can hide and rideSiam Journal on Discrete Mathematics, 25(1), pp.333-359, 2011,
inria-00622957N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, N. Nisse
Tradeoffs in process strategy games with application in the WDM reconfiguration problemTheoretical Computer Science, 412(35), pp.4675-4687, 2011,
inria-00592507N. Cohen, F. Havet
Linear and 2-Frugal Choosability of Graphs of Small Maximum Average DegreeGraphs and Combinatorics, 27(6), pp.831--849, 2011,
inria-00638460N. Cohen, F. Havet
Planar graphs with maximum degree $\\Delta\\geq 9$ are ($\\Delta+1$)-edge-choosable ― short proofDiscrete Mathematics, 310(21), pp.3049―3051, 2010,
hal-00794911R. Correa, F. Havet, J.-S. Sereni
About a Brooks-type theorem for improper colouringThe Australasian Journal of Combinatorics, 43 pp.219--230, 01/2009,
inria-00223009R. Correa, F. Havet, J.-S. Sereni
About a Brooks-type theorem for improper colouring.Australasian Journal of Combinatorics, 43 pp.219--230, 2009,
inria-00496419D. Coudert, F. Huc, D. Mazauric
A Distributed Algorithm for Computing the Node Search Number in TreesAlgorithmica, 63(1), pp.158-190, 2012,
inria-00587819D. Coudert, J.-S. Sereni
Characterization of graphs and digraphs with small process numberDiscrete Applied Mathematics, 159(11), pp.1094-1109, 06/07/2011,
inria-00587717D. Coudert, F. Giroire, I. Sau
Circuits in graphs through a prescribed set of ordered verticesJournal of Interconnection Networks, 11(3-4), pp.121-141, 2011,
inria-00585561D. Coudert, N. Nepomuceno, H. Rivano
Power-Efficient Radio Configuration in Fixed Broadband Wireless NetworksComputer Communications, 33(8), pp.898-906, 2010,
inria-00466477D. Coudert, F. Huc, J.-S. Sereni
Pathwidth of outerplanar graphsJournal of Graph Theory, 55(1), pp.27 - 41, 2007,
inria-00429216D. Coudert, P. Datta, S. Pérennes, H. Rivano, M.-E. Voge
Shared Risk Resource Group: Complexity and Approximability issuesParallel Processing Letters, 17(2), pp.169-184, 2007,
hal-00371100D. Coudert, A. Ferreira, S. Pérennes
Isomorphisms of the De Bruijn digraph and free-space optical networksNetworks, 40(3), pp.155 - 164, 10/2002,
inria-00429201D. Coudert, A. Ferreira, X. Munoz
A multihop multi-OPS optical interconnection networkJournal of Lightwave Technology / IEEE/OSA Journal of Lightwave Technology; IEEE Journal of Lightwave Technology, 18(12), pp.2076 - 2085, 12/2000,
inria-00429200D. Coudert, A. Ferreira, X. Munoz
Topologies for Optical Interconnection Networks Based on the Optical Transpose Interconnection SystemOSA Applied Optics -- Information Processing, 39(17), pp.2965-2974, 06/2000,
inria-00429198O. Dalle, G. Wainer, L. Qi, Z. Bernard P.
Applying Cellular Automata and DEVS Methodologies to Digital Games: A SurveySimulation & Gaming, 41(6), pp.796-823, 01/12/2010,
inria-00530927O. Delmas, S. Pérennes
Diffusion par commutation de circuits dans les tores de dimension k / Circuit-switched broadcasting in the k-dimensional torus networksRevue Technique et Science Informatiques (TSI), 16(5), pp.563-581, 1997,
hal-00407475S. Demathieu, Y. Bernard, L. Maillet-Contoz, M. Bordin, F. Mallet
Mise en œuvre du MDE pour la conception de systèmes embarqués: premiers résultats et perspectives du projet LambdaGénie logiciel, (93), pp.38-42, 06/2010,
inria-00545266M. Djemal, F. Pêcheux, D. Potop-Butucaru, R. De Simone, F. Wajsburt, Z. Zhang
Programmable routers for efficient mapping of applications onto NoC-based MPSoCsDASIP 2012 - Conference on Design and Architectures for Signal and Image Processing, 24/10/2012,
hal-00787497N. Eggemann, F. Havet, S. Noble
k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$.Discrete Applied Mathematics, 158(16), pp.1777-1788, 2010,
inria-00534520R. Erman, F. Havet, B. Lidický, O. Pangrac
5-colouring graphs with 4 crossingsSiam Journal on Discrete Mathematics, 25(1), pp.401-422, 2011,
inria-00638434A. Ferreira, A. Jarry
Minimum-Energy Broadcast Routing in Dynamic Wireless NetworksJournal of Green Engineering, 2(2), pp.115-123, 2012,
hal-00793579A. Ferreira, A. Goldman, J. Monteiro
Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphsWireless Networks, 16(3), pp.627-640, 04/2010,
inria-00496219A. Ferreira
Uma estratégia face à Revolução DigitalTeoria e Debate, 87(Mar/Avr), pp.20 - 23, 2010,
inria-00510741A. Ferreira, S. Pérennes, A. W. Richa, H. Rivano, N. Stier Moses
Models, Complexity and Algorithms for the Design of Multi-fiber WDM NetworksTelecommunication Systems, 24(2), pp.123--138, 2003,
hal-00371107A. Ferreira, J. Galtier, J.-N. Petit, H. Rivano
Re-routing algorithms in a meshed satellite constellationAnnales des Télécommunications, 56(3/4), pp.169--174, 2001,
hal-00371111M. Flammini, R. Klasing, A. Navarra, S. Pérennes
Tightening the upper bound for the Minimum Energy BroadcastingWireless Networks, 14(5), pp.659--669, 2008,
hal-00307023F. V. Fomin, P. A. Golovach, J. Kratochvil, N. Nisse, K. Suchan
Pursuing a fast robber on a graphTheoretical Computer Science, 411(7-9), pp.1167-1181, 2010,
inria-00476686F. Fomin, P. Fraigniaud, N. Nisse
Non-Deterministic Graph Searching: From Pathwidth to TreewidthAlgorithmica, 53(3), pp.358-373, 03/2009,
hal-00421417P. Fraigniaud, N. Nisse
Monotony Properties of Connected Visible Graph SearchingInformation and Computation, 206(12), pp.1383-1393, 12/2008,
hal-00421416C. Gavoille, D. Peleg, S. Perennes, R. Raz
Distance Labeling in GraphsJournal of Algorithms, 53 pp.85-112, 2004,
hal-00307381F. Giroire
Order statistics and estimating cardinalities of massive data setsDiscrete Applied Mathematics, 157(2), pp.406-427, 2009,
hal-00646123C. Glitia, J. Deantoni, F. Mallet, J.-V. Millo, P. Boulet, A. Gamatié
Progressive and explicit refinement of scheduling for multidimensional data-flow applications using uml marteDesign Automation for Embedded Systems, 16(2), pp.137-169, 2012,
hal-00727239D. Gonçalves, F. Havet, A. Pinlou, S. Thomassé
Spanning Galaxies in DigraphsDiscrete Applied Mathematics, 160(6), pp.744-754, 01/10/2012,
lirmm-00738549D. Gonçalves, F. Havet, A. Pinlou, S. Thomassé, D. P. Gonçalvez
The spanning galaxy problemDiscrete Applied Mathematics, 160(6), pp.744-754, 2012,
hal-00749191D. Gonçalves, F. Havet, A. Pinlou, S. Thomassé
On spanning galaxies in digraphsDiscrete Applied Mathematics, 160(6), pp.744-754, 2012,
lirmm-00736492F. Havet, X. Zhu
The game Grundy number of graphsJournal of Combinatorial Optimization, 25(4), pp.752-765, 2013,
hal-00821597F. Havet, B. Reed, J.-S. Sereni
Griggs and Yeh's Conjecture and L(p,1)-labelingsSiam Journal on Discrete Mathematics, 26(1), pp.145--168, 02/2012,
inria-00327909F. Havet, B. Reed, J.-S. Sereni
Griggs and Yeh's conjecture and L(p, 1)-labellingsSiam Journal on Discrete Mathematics, 26(1), pp.145--168, 2012,
hal-00749193F. Havet, C. Linhares Sales, L. Sampaio
b-coloring of tight graphsDiscrete Applied Mathematics, 160(18), pp.2709--2715, 2012,
hal-00749192F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, M. Liedloff
Exact Algorithms for L(2,1)-Labeling of GraphsAlgorithmica, 59(2), pp.169-194, 2011,
hal-00460873F. Havet, S. Jendrol', R. Sotak, E. Skrabulakova
Facial non-repetitive edge-colouring of plane graphsJournal of Graph Theory, 66(1), pp.38--48, 2011,
inria-00638439F. Havet, D. Král', J.-S. Sereni, R. Skrekovski
Facial colorings using Hall's TheoremEuropean Journal of Combinatorics, 31(3), pp.1001--1019, 04/2010,
hal-00487100F. Havet, R. Kang, J.-S. Sereni
Improper Colouring of Unit Disk GraphsNetworks, 54(3), pp.150--164, 2009,
inria-00496436F. Havet, R. Kang, T. Müller, J.-S. Sereni
Circular choosabilityJournal of Graph Theory, 61(4), pp.241--270, 2009,
inria-00496432F. Havet, S. Thomassé
Complexity of $(p,1)$-Total LabellingDiscrete Applied Mathematics, 157 pp.2859-2870, 2009,
lirmm-00432700F. Havet, S. Thomassé
Complexity of $(p,1)$-total labellingDiscrete Applied Mathematics, 157 pp.2859--2870, 2009,
inria-00496441F. Havet
Choosability of the square of planar subcubic graphs with large girthDiscrete Mathematics, 309 pp.3553--3563, 2009,
inria-00496423F. Havet, J.-S. Sereni, R. Skrekovski
3-facial colouring of plane graphsSIAM Journal on Discrete Mathematics, 22(1), pp.231--247, 20/02/2008,
inria-00083533F. Havet, S. Thomassé, A. Yeo
The Hoàng-Reed Conjecture holds for tournamentsDiscrete Mathematics, 308 pp.3412-3415, 2008,
lirmm-00292710F. Hermenier, J. L. Lawall, G. Muller
BtrPlace: A Flexible Consolidation Manager for Highly Available ApplicationsIEEE Transactions on Dependable and Secure Computing, pp.1, 2013,
hal-00779855D. Ilcinkas, N. Nisse, D. Soguet
The Cost of Monotonicity in Distributed Graph SearchingDistributed Computing, 22(2), pp.117-127, 2009,
hal-00412063A. Jarry, S. Pérennes
Disjoint Path in symmetric GraphsDiscrete Applied Mathematics, 157(1), pp.90-97, 2009,
hal-00795283R. Klasing, Z. Lotker, A. Navarra, S. Pérennes
From Balls and Bins to Points and VerticesAlgorithmic Operations Research, 4(2), pp.133--143, 2009,
hal-00342915R. Klasing, S. Pérennes, N. Morales
On the Complexity of Bandwidth Allocation in Radio NetworksTheoretical Computer Science, 406(3), pp.225--239, 10/2008,
hal-00342875J. Liu, Z. Liu, J. He, F. Mallet, Z. Ding
Hybrid MARTE statechartsFrontiers of Computer Science, 01/2013,
hal-00800920F. Mallet, C. André, R. De Simone
Logical Time: observation vs. implementationACM SIGSOFT Software Engineering Notes, 36(1), pp.1--8, 01/2011,
inria-00576647F. Mallet, C. André, F. Lagarde
Un processus automatique pour concevoir les profils UMLRevue Technique et Science Informatiques (TSI), 29(5), pp.391-419, 05/2010,
inria-00482745F. Mallet, J. Deantoni, C. André, R. De Simone
The Clock Constraint Specification Language for building timed causality modelsInnovations in Systems and Software Engineering, 6(1-2), pp.99-106, 03/2010,
inria-00464894F. Mallet
CCSL: specifying clock constraints with UML/MARTEInnovations in Systems and Software Engineering, 4(3), pp.309-314, 2008,
inria-00371371F. Mazoit, N. Nisse
Monotonicity of non-deterministic graph searchingJournal of Theoretical Computer Science (TCS), 399 pp.169--178, 06/2008,
hal-00306321J.-V. Millo, R. De Simone
Periodic scheduling of marked graphs using balanced binary wordsTheoretical Computer Science, 458(2), pp.113-130, 02/11/2012,
hal-00764076N. Nisse, I. Rapaport, K. Suchan
Distributed computing of efficient routing schemes in generalized chordal graphsTheoretical Computer Science, 444(27), pp.17-27, 2012,
hal-00741970N. Nisse
Connected Graph Searching in Chordal GraphsDiscrete Applied Mathematics, 157(12), pp.2603-2610, 28/06/2009,
hal-00421414N. Nisse, D. Soguet
Graph Searching with AdviceTheoretical Computer Science, 410(14), pp.1307-1318, 28/03/2009,
hal-00421415C. Paul, S. Guillemot, F. Havet, A. Perez
On the (Non-)Existence of Polynomial Kernels for Pl-Free Edge Modification ProblemsAlgorithmica, 65(4), pp.900-926, 21/02/2012,
hal-00807591S. Thomassé, F. Havet, L. Addario-Berry
Paths with two blocks in n-chromatic digraphsJournal of Combinatorial Theory Series B, 97 pp.620-626, 2007,
lirmm-00197151
COMMUNICATIONS INTERNATIONALES
A. ALBINET, J.-L. Boulanger, H. Dubois, M.-A. Peraldi-Frati, Y. Sorel, Q.-D. Van
Model-Based Methodology for Requirements Traceability in Embedded SystemsProceedings of 3rd European Conference on Model Driven Architecture® Foundations and Applications, ECMDA'07, 2007, Haifa, Israël,
inria-00413488S. Alouf, F. Huet, P. Nain
Forwarders vs. centralized server: an evaluation of two approaches for locating mobile agentsACM SIGMETRICS international conference on Measurement and modeling of computer systems - 2002, 15/06/2002, Marina Del Rey, California, États-Unis, Proceedings of ACM SIGMETRICS 2002, 30, pp.278-279, ACM SIGMETRICS Performance Evaluation Review,
hal-00641394B. Amedro, F. Baude, F. Huet, E. Mathias
Combining Grid and Cloud Resources by Use of Middleware for SPMD Application2nd International Conference on Cloud Computing Technology and Science, 30/11/2010, Indianapolis, IN, États-Unis, pp.177-184,
inria-00538549R. Ameur-Boulifa, L. Henrio, E. Madelaine
Behavioural models for group communicationsInt. Workshop on Components and Service Interoperability (WCSI), 06/2010, Malaga, Espagne, pp.15 p.,
inria-00493692O. Amini, J.-C. Bermond, F. Giroire, F. Huc, S. Pérennes
Design of Minimal Fault Tolerant Networks: Asymptotic BoundsAlgotel06, 05/2006, Tregastel, France, pp.169-174,
hal-00512287C. André, F. Mallet, J. Deantoni
VHDL Observers for Clock Constraint CheckingSymposium on Industrial Embedded Systems, 07/07/2010, trento, Italie,
inria-00587107C. André, F. Mallet
Specification and Verification of Time Requirements with CCSL and EsterelLanguages, Compilers, and Tools for Embedded Systems, 19/06/2009, Dublin, Irlande, ACM SIGPLAN Notices, 44, pp.167-176,
inria-00416654C. André, F. Mallet, M.-A. Peraldi-Frati
A multiform time approach to real-time system modeling: Application to an automotive systemIEEE Int. Symp. on Industrial Embedded Systems (SIES), 07/2007, Lisbon, Portugal, pp.234-241,
inria-00204508C. André, F. Mallet, M.-A. Peraldi-Frati
Multiform Time in UML for Real-time Embedded ApplicationsIEEE Int. Conf. on Real-Time Computing Systems and Applications (RTCSA), 08/2007, Daegu, Corée, République De, pp.232-237,
inria-00204503C. André, F. Mallet, R. De Simone
Modeling Time(s)ACM/IEEE Int. Conf. on Model Driven Engineering Languages and Systems (MoDELS/UML), 10/2007, Nashville, TN, États-Unis, MoDELS, LNCS 4735, pp.pp. 559-573, Lecture Notes in Computer Sciences,
inria-00204489C. André, F. Mallet, R. De Simone
Modeling of Immediate vs. Delayed Data Communications: from AADL to UML MARTEECSI Forum on specification & Design Languages (FDL), 09/2007, Barcelona, Espagne, pp.249-254,
inria-00204484C. André, F. Mallet, R. De Simone
Time Modeling in MARTEECSI Forum on specification & Design Languages (FDL), 09/2007, Barcelona, Espagne, pp.268-273,
inria-00204481J. Araujo, F. Giroire, Y. Liu, M. Remigiusz, J. Moulierac
Energy Efficient Content DistributionICC - International Conference on Communications, 09/06/2013, Budapest, Hongrie,
hal-00800273J. Araujo, J.-C. Bermond, F. Giroire, F. Havet, D. Mazauric, R. Modrzejewski
Weighted Improper Colouring22th International Workshop, IWOCA 2011, 20/07/2011, Victoria, Canada,
inria-00635882J. Araujo, F. Giroire, J. Monteiro
Hybrid Approaches for Distributed Storage SystemsFourth International Conference on Data Management in Grid and P2P Systems (Globe 2011), 01/09/2011, Toulouse, France,
inria-00635781J. Araujo, N. Cohen, F. Giroire, F. Havet
Good edge-labelling of graphsLAGOS'09 - V Latin-American Algorithms, Graphs and Optimization Symposium, 03/11/2009, Gramado, Brésil, Eletronic Notes in Discrete Mathematics, Volume 35, pp.275-280,
hal-00749194J. Araújo, V. Campos, F. Giroire, L. Sampaio, R. Pardo Soares
On the hull number of some graph classesEuropean Conference on Combinatorics, Graph Theory and Applications (EuroComb'11), 29/08/2011, Budapest, Hongrie, Electronic Notes in Discrete Mathematics, 38, pp.49-55,
inria-00635032D. Barman, J. Chandrashekar, N. Taft, M. Faloutsos, L. Huang, F. Giroire
Impact of IT Monoculture on Behavioral End Host Intrusion DetectionACM SIGCOMM Workshop on Research on Enterprise Networking -- WREN, 21/08/2009, Barcelona, Espagne, pp.27--36,
inria-00546878D. Barman, J. Chandrashekar, N. Taft, M. Faloutsos, L. Huang, F. Giroire
Impact of IT Monoculture on Behavioral End Host Intrusion DetectionACM SIGCOMM Workshop on Research on Enterprise Networking ― WREN, 2009, Barcelone, Espagne, pp.27―36,
hal-00795994F. Baude, V. Legrand, V. Lestideau
Large-Scale Service Deployment--Application to OSGiThird International Conference on Autonomic and Autonomous Systems, 19/06/2007, Athens, Grèce, pp.19,
hal-00756264F. Baude, L. Henrio, P. Naoumenko
A Component Platform for Experimenting with Autonomic CompositionFirst International Conference on Autonomic Computing and Communication Systems (Autonomics 2007), 28/10/2007, Rome, Italie,
inria-00178365F. Baude, D. Caromel, R. Quilici
Grid File Transfer during DeploymentOn the Move to Meaningful Internet Systems 2006, 29/10/2006, Montpellier, France, 4276, pp.1191-1202, Lecture Notes in Computer Science,
hal-00688861F. Becker, A. Kosowski, N. Nisse, I. Rapaport, K. Suchan
Allowing Each Node to Communicate Only Once in a Distributed System: Shared Whiteboard ModelsSymposium on Parallelism in Algorithms and Architectures, 2012, États-Unis, pp.7,
hal-00704200F. Becker, M. Matamala, N. Nisse, I. Rapaport, K. Suchan, I. Todinca
Adding a referee to an interconnection network: What can(not) be computed in one round.25th IEEE International Symposium on Parallel & Distributed Processing (IPDPS), 2011, Anchorage, États-Unis, pp.508-514,
inria-00622976S. Belhareth, D. Coudert, D. Mazauric, N. Nisse, I. Tahiri
Reconfiguration with physical constraints in WDM networksWorkshop on New Trends in Optical Networks Survivability, 2012, Canada, pp.5,
hal-00704199S. Belhareth, D. Coudert, D. Mazauric, N. Nisse, I. Tahiri
Reconfiguration avec contraintes physiques dans les réseaux WDM13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France,
inria-00583829J.-C. Bermond, D. Coudert, G. D'Angelo, F. Z. Moataz
Diverse Routing in Networks with Star SRLGsACM CoNEXT Student Workshop, 10/12/2012, Nice, France, pp.1-2,
hal-00747757J.-C. Bermond, L. Gargano, S. Pérennes, A. Rescigno, U. Vaccaro
Optimal Time Data Gathering in Wireless Networks with Omni-Directional AntennasSIROCCO2011, 26/06/2011, Gdansk, Pologne, 6796, pp.306-317, Lecture Notes in Computer Science - LNCS,
inria-00589687J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, H. Rivano, I. Sau, F. Solano Donado
MPLS label stacking on the line networkIFIP Networking, 11/05/2009, Aachen, Allemagne, pp.809-820, LNCS 5550/2009,
hal-00371115J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau, F. Solano Donado
Designing Hypergraph Layouts to GMPLS Routing StrategiesSIROCCO, 25/05/2009, Piran, Slovénie,
inria-00428685J.-C. Bermond, N. Nisse, P. Reyes, H. Rivano
Fast Data Gathering in Radio Grid NetworksAlgoTel, 2009, Carry-Le-Rouet, France,
inria-00376040J.-C. Bermond, N. Nisse, P. Reyes, H. Rivano
Minimum delay Data Gathering in Radio Networks8th international conference on Ad Hoc Networks and Wireless (AdHoc-Now),, 23/09/2009, Murcia, Espagne, 5793, pp.69-82,, Lecture Notes in Computer Science,,
inria-00505522J.-C. Bermond, F. Giroire, S. Pérennes
Design of Minimal Fault Tolerant On-Board Networks : Practical constructionsSIROCCO07, 06/2007, Castiglioncello, Italie, 4474, pp.261-273, Lecture Notes in Computer Science,,
hal-00512282J.-C. Bermond, J. Galtier, R. Klasing, N. Morales, S. Pérennes
Hardness and approximation of Gathering in static radio networksFAWN06, 03/2006, Italie, pp.75--79,
hal-00344619J.-C. Bermond, D. Coudert, X. Munoz, I. Sau
Traffic Grooming in Bidirectional WDM Ring NetworksInternational Conference on Transparent Optical Networks (ICTON), 06/2006, Nottingham, Royaume-Uni, 3, pp.19 - 22,
inria-00429168J.-C. Bermond, M. Cosnard, D. Coudert, S. Pérennes
Optimal Solution of the Maximum All Request Path Grooming ProblemAdvanced International Conference on Telecommunications (AICT), 19/02/2006, Le Gosier, Guadeloupe, France,
inria-00429167J.-C. Bermond, L. Braud, D. Coudert
Traffic Grooming on the Path12th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 24/05/2005, Mont Saint-Michel, France, SIROCCO, pp.34-48, Lecture Notes in Computer Science,
inria-00429172J.-C. Bermond, D. Coudert, X. Munoz
Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case7th IFIP Working Conference on Optical Network Design & Modelling (ONDM), 2003, Budapest, Hongrie, pp.1135-1153,
inria-00429175J.-C. Bermond, D. Coudert
Traffic Grooming in Unidirectional WDM Ring Networks using Design TheoryIEEE International Conference on Communications (ICC '03)., 05/2003, Anchorage, États-Unis, 2, pp.1402 - 1406,
inria-00429174J.-C. Bermond, D. Coudert, L. Chacon, F. Tillerot
A note on cycle coveringACM Symposium on Parallel Algorithms and Architectures (SPAA), 2001, Hersonissos, Grèce, pp.310-311,
inria-00429182J.-C. Bermond, L. Chacon, D. Coudert, F. Tillerot
Cycle Covering8th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 27/06/2001, Vall de Nuria, Espagne, pp.21-34, Proceedings in Informatics,
inria-00429183S. Bezinne, V. Galtier, S. Vialle, F. Baude, M. Bossy, V. Dung, L. Henrio
A Fault Tolerant and Multi-Paradigm Grid Architecture for Time Constrained Problems. Application to Financial Option Pricing2nd IEEE International Conference on e-Science and Grid Computing - e-science'06, 12/2006, Amsterdam, Pays-Bas, pp.49,
inria-00121828L. Blin, J. Burman, N. Nisse
Brief Announcement: Distributed Exclusive and Perpetual Tree SearchingDISC - 26th International Symposium on Distributed Computing, 10/2012, Salvador, Brésil,
hal-00741982L. Blin, J. Burman, N. Nisse
Nettoyage perpétuel de réseaux14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2012, La Grande Motte, France, pp.4,
hal-00687134F. Bongiovanni, L. Henrio
A Mechanized Model for CAN Protocols16th International Conference on Fundamental Approaches to Software Engineering (FASE'13), 18/03/2013, Rome, Italie,
hal-00802006M. Bouklit, D. Coudert, J.-F. Lalande, C. Paul, H. Rivano
Approximate Multicommodity Flow for WDM Networks DesignSIROCCO'03: Colloquium on Structural Information and Communication Complexity, Umeä (Sweden), pp.pp. 43-56,
lirmm-00269524B. Bui Xuan, A. Ferreira, A. Jarry
Evolving graphs and least cost journeys in dynamic networksWiOpt'03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 03/03/2003, Sophia Antipolis, France, pp.10 pages,
inria-00466676C. Caillouet, A. Koster
Routage et Ordonnancement Robustes dans les Réseaux Radio Maillés13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France,
inria-00586698C. Caillouet, N. Nisse, F. Huc, S. Pérennes, H. Rivano
Stability of a Localized and Greedy Routing Algorithm12th IEEE Workshop in Parallel and Distributed Computational Models (IEEE APDCM 2010), in conjunction with IPDPS 2010, 19/04/2010, Atlanta, États-Unis, Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010 IEEE International Symposium on,
inria-00466484C. Caillouet, S. Pérennes, H. Rivano
Cross Line and Column Generation for the Cut Covering Problem in Wireless NetworksInternational Symposium on Combinatorial Optimization (ISCO 2010), 2010, Hammamet, Tunisie, Electronic Notes in Discrete Mathematics, 36, pp.255-262,
inria-00466485A. Cansado, L. Henrio, E. Madelaine
Transparent First-class Futures and Distributed Components5th workshop on Formal Aspects of Component Systems, 10/09/2008, Málaga, Espagne,
inria-00311515A. Cansado, L. Henrio, E. Madelaine
Unifying Architectural and Behavioural Specifications of Distributed Components5th workshop on Formal Aspects of Component Systems, 10/09/2008, Málaga, Espagne,
inria-00311516I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, H. Rivano
Fractional path coloring on bounded degree treesProceedings of the 28th ICALP, 07/2001, Grèce, 2076, pp.732--743, Lecture Notes in Computer Science,
hal-00429854D. Caromel, L. Mateu, E. Tanter
Sequential Object Monitors18th European Conference on Object-Oriented Programming, 2004, Oslo, Norway, Norvège, 3086, pp.316-340, lncs,
hal-00457132S. Caron, F. Giroire, D. Mazauric, J. Monteiro, S. Pérennes
Data Life Time for Different Placement Policies in P2P Storage SystemsConference on Data Management in Grid and P2P Systems (Globe 2010), 09/2010, Bilbao, Espagne, LNCS 6265, pp.75--88,
inria-00496222S. Caron, F. Giroire, D. Mazauric, J. Monteiro, S. Pérennes
P2P Storage Systems: Data Life Time for Different Placement Policies12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France,
inria-00479537A. Casteigts, S. Chaumette, A. Ferreira
Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks16th International Colloquium on Structural Information and Communication Complexity (SIROCCO'09), 25/05/2009, Piran, Slovénie, 5869, pp.129--144, Lecture Notes in Computer Science,
hal-00408054Y. Chen, Y. Chen, E. Madelaine
Timed-pNets: A formal communication behavior model for real-time CPS systemTrustworthy Cyber-Physical Systems, 03/09/2012, Newcastle, Royaume-Uni,
hal-00725328G. Classen, D. Coudert, A. Koster, N. Nepomuceno
A Chance-Constrained Model & Cutting Planes for Fixed Broadband Wireless NetworksInternationale Network Optimization Conference (INOC), 13/06/2011, Hamburg, Allemagne, 6701, pp.37-42, Lecture Notes in Computer Science,
inria-00587669G. Classen, D. Coudert, A. Koster, N. Nepomuceno
Bandwidth assignment for reliable fixed broadband wireless networks12th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM), 20/06/2011, Lucca, Italie, pp.1-6,
inria-00587698N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, N. Nisse
Tradeoffs in process strategy games with application in the WDM reconfiguration problemFifth International conference on Fun with Algorithms (FUN 2010), 02/06/2010, Ischia, Italie, 6099, pp.121-132, Lecture Notes in Computer Science,
inria-00495443N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, N. Nisse
Tradeoffs in routing reconfiguration problems12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France,
inria-00477413D. Coudert, L. Hogie, A. Lancin, D. Papadimitriou, S. Pérennes, I. Tahiri
Feasibility study on distributed simulations of BGPPADS - 26th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation - 2012, 15/07/2012, Zhangjiajie, Chine,
hal-00706415D. Coudert, N. Nepomuceno, I. Tahiri
Energy saving in fixed wireless broadband networksInternationale Network Optimization Conference (INOC), 13/06/2011, Hamburg, Allemagne, 6701, pp.484-489, Lecture Notes in Computer Science,
inria-00587685D. Coudert, N. Nepomuceno, I. Tahiri
Optimisation de la consommation énergétique dans les réseaux sans fil fixes13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France,
inria-00588129D. Coudert, D. Mazauric, N. Nisse
On Rerouting Connection Requests in Networks with Shared BandwidthDIMAP Workshop on Algorithmic Graph Theory (AGT), 2009, Warwick, Royaume-Uni, Electronic Note Discrete Maths., 32,
inria-00423452D. Coudert, F. Giroire, I. Sau
Edge-Simple Circuits Through 10 Ordered Vertices in Square GridsInternational Workshop on Combinatorial Algorithms -- IWOCA, 28/06/2009, Hradec nad Moravicì, Tchèque, République, 5874, Lecture Notes in Computer Science,
inria-00429146D. Coudert, F. Huc, D. Mazauric, N. Nisse, J.-S. Sereni
Reconfiguration dans les réseaux optiques11èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2009, Carry-Le-Rouet, France,
inria-00383206D. Coudert, F. Huc, D. Mazauric, N. Nisse, J.-S. Sereni
Reconfiguration of the Routing in WDM Networks with Two Classes of ServicesConference on Optical Network Design and Modeling (ONDM), 2009, Braunschweig, Allemagne,
inria-00423453D. Coudert, N. Nepomuceno, H. Rivano
Joint Optimization of Routing and Radio Configuration in Fixed Wireless NetworksAlgoTel, 2009, Carry-Le-Rouet, France,
inria-00384968D. Coudert, N. Nepomuceno, H. Rivano
Minimizing Energy Consumption by Power-Efficient Radio Configuration in Fixed Broadband Wireless Networks1st IEEE WoWMoM Workshop on Hot Topics in Mesh Networking (HotMESH), 06/2009, Kos, Grèce,
inria-00429148D. Coudert, F. Huc, D. Mazauric
A distributed algorithm for computing and updating the process number of a forest22nd International Symposium on Distributed Computing (DISC), 2008, Arcachon, France, France, 5218, pp.500-501,
inria-00373850D. Coudert, F. Huc, D. Mazauric
Computing and updating the process number in trees12th International Conference On Principles Of DIstributed Systems (OPODIS), 12/2008, Luxor, Égypte, 5401, Lecture Notes in Computer Science,
inria-00429149D. Coudert, F. Huc, F. Peix, M.-E. Voge
Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs ConstraintsIEEE International Conference on Communications (ICC '08), 05/2008, Beijing, Chine, pp.5170 - 5174,
inria-00429150D. Coudert, S. Pérennes, H. Rivano, M.-E. Voge
Shared Risk Resource Groups and Survivability in Multilayer NetworksInternational Conference on Transparent Optical Networks (ICTON), 06/2006, Nottingham, Royaume-Uni, 3, pp.235 - 238,
inria-00429170D. Coudert, H. Rivano, X. Roche
A Combinatorial Approximation Algorithm for the Multicommodity Flow ProblemInternational Workshop on Approximation and Online Algorithms (WAOA'03), 2003, Budapest, Hongrie, Approximation and Online Algorithms, 2909, pp.193-230, Lecture Notes in Computer Science,
inria-00429176D. Coudert, H. Rivano
Lightpath assignment for multifibers WDM networks with wavelength translatorsIEEE Global Telecommunications Conference (Globecom'02), 2002, Taipei, Taïwan, Province De Chine, 3, pp.2686 - 2690,
inria-00429177D. Coudert, X. Munoz
How Graph Theory can help Communications EngineeringBroad band optical fiber communications technology (BBOFCT), 12/2001, Jalgaon, Inde, pp.47-61,
inria-00429187D. Coudert, A. Ferreira, S. Pérennes
De Bruijn isomorphisms and free space optical networks14th International Parallel and Distributed Processing Symposium (IPDPS 2000), 01/05/2000, Cancun, Mexique, pp.769 - 774,
inria-00429190D. Coudert, A. Ferreira, X. Munoz
OTIS-Based Multi-Hop Multi-OPS Lightwave Networks3rd Workshop on Optics and Computer Science (WOCS), 04/1999, San Juan, Porto Rico, 1586, pp.897-910, Lecture Notes in Computer Science,
inria-00429192D. Coudert, A. Ferreira, X. Munoz
Multiprocessor Architectures Using Multi-hops Multi-OPS Lightwave Networks and Distributed ControlFirst Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing (IPPS/SPDP 1998), 30/03/1998, Orlanda, États-Unis, pp.151 - 155,
inria-00429196S. Cussat-Blanc, F. Viale, H. Luga, Y. Duthen, D. Caromel
Genetic algorithms and grid computing for artificial embryogenyGECCO '08 Proceedings of the 10th annual conference on Genetic and evolutionary computation, 12/07/2008, Atlanta, États-Unis, pp.281-282,
hal-00687153O. Dalle, E. P. Mancini
NetStep: a micro-stepped distributed network simulation frameworkSIMUTools - 6th International ICST Conference on Simulation Tools and Techniques - 2013, 05/03/2013, Cannes, France,
hal-00787636O. Dalle
On reproducibility and traceability of simulationsWSC - Winter Simulation Conference - 2012, 09/12/2012, Berlin, Allemagne, pp.244,
hal-00782834O. Dalle, E. P. Mancini
Integrated Tools for the Simulation Analysis of Peer-To-Peer Backup SystemsSIMUTOOLS 2012, 19/03/2012, Sirmione, Italie, pp.178-183,
hal-00669241O. Dalle, E. Mancini
Traces Generation To Simulate Large-Scale Distributed ApplicationsWinter Simulation Conference, 12/2011, Phoenix, AZ, États-Unis, pp.2993-3001,
inria-00638561O. Dalle, J. Ribault
Some Desired Features for the DEVS Architecture Description LanguageSymposium On Theory of Modeling and Simulation -- DEVS Integrative M\&S Symposium (TMS/DEVS 2011), 04/04/2011, Boston, MA, États-Unis, PROCEEDINGS OF THE 2011 SPRING SIMULATION MULTICONFERENCE, Book 4 -- Symposium on Theory of Modeling & Simulation - DEVS Integrative M&S Symposium (TMS/DEVS), pp.258-263,
inria-00638565O. Dalle, F. Giroire, J. Monteiro, S. Pérennes
Analyse des Corrélations entre Pannes dans les Systèmes de Stockage Pair-à-PairAlgoTel, 2009, Carry-Le-Rouet, France,
inria-00384822O. Dalle, F. Giroire, J. Monteiro, S. Pérennes
Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems9th IEEE International Conference on Peer-to-Peer Computing (P2P), 09/2009, Seattle, États-Unis, pp.184--193,
inria-00485847O. Dalle, F. Giroire, J. Monteiro, S. Pérennes
Analyse des Corrélations entre Pannes dans les Systèmes de Stockage Pair-à-PairAlgoTel, 2009, Carry-Le-Rouet, France,
inria-00384822O. Dalle, F. Giroire, J. Monteiro, S. Pérennes
Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems9th IEEE International Conference on Peer-to-Peer Computing (P2P), 09/2009, Seattle, États-Unis, pp.184--193,
inria-00485847O. Dalle, J. Ribault, J. Himmelspach
Design considerations for M&S softwareWinter Simulation Conference (WSC'09), 13/12/2009, Austin, États-Unis, Proceedings of the 2009 Winter Simulation Conference, pp.944 - 955,
inria-00425153J. Deantoni, F. Mallet
TimeSquare: Treat your Models with Logical TimeTOOLS - 50th International Conference on Objects, Models, Components, Patterns - 2012, 29/05/2012, Prague, Tchèque, République, Objects, Models, Components, Patterns, 7304, pp.34-41, Lecture Notes in Computer Science - LNCS,
hal-00688590J. Deantoni, F. Mallet, F. Thomas, G. Reydet, J.-P. Babau, C. Mraidha, L. Gauthier, L. Rioux, N. Sordon
RT-simex: retro-analysis of execution tracesSIGSOFT FSE, 07/11/2010, Santa Fe, États-Unis, Proceedings of the 18th ACM SIGSOFT International Symposium on Foundations of Software Engineering, ISBN 978-1-60558-791-2, pp.377-378,
inria-00587116J. Deantoni, J.-P. Babau
SAIA: safe deployment of sensors based real time applicationWorkshop on Models and Analysis for Automotive Systems (held in conjunction with RTSS), 05/12/2006, Rio de Janeiro, Brésil,
inria-00587178J. Deantoni, J.-P. Babau
A MDA Approach for Systems Dedicated to Process ControlProceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, 17/08/2005, hong kong, Chine, pp.567--570,
inria-00587341J. Deantoni, J.-P. Babau
A MDA-based approach for real time embedded systems simulationProceedings of the 9th IEEE International Symposium on Distributed Simulation and Real-Time Applications, 10/10/2005, Washington, DC, USA, États-Unis, pp.257--264,
inria-00587338O. Delmas, S. Pérennes
Circuit-switched gossiping in 3-dimensional torus networksEuro-Par'96 Parallel Processing, 26/08/1996, Lyon, France, 1123/1996, pp.370-373, Lecture Notes in Computer Science,
hal-00407414H. Dubois, M.-A. Peraldi-Frati, L. Fadoi
A model for requirements traceability in an heterogeneous model-based design process. Application to automotive embedded systemsICECCS'10, 22/03/2010, Oxford, Royaume-Uni, 15th IEEE International Conference on Engineering of Complex Computer Systems, ISBN:978-0-7695-4015-3, pp.233-242,
inria-00484073V. Dung Doan, A. Gaikwad, F. Baude, M. Bossy
"Gridifying" Classification-Monte Carlo algorithm for pricing high-dimensional Bermudan-American optionsWorkshop on high performance computational finance, WHPCF Austin, TX - November 16th, 2008, 16/11/2008, Austin, États-Unis, pp.1-8,
hal-00605774A. Ferreira
Road-mapping the Digital Revolution: Visions from COST Foresight 2030 (An exercise in multi-disciplinarity)Proceedings of IEEE Wireless VITAE\'09, 2009, Aalborg, Danemark, pp.5p,
hal-00795279A. Ferreira, S. Pérennes, A. W. Richa, H. Rivano, N. Stier Moses
Models, complexity and algorithms for the design of multifiber WDM networks10th International Conference on Telecommunications, 2003 (ICT 2003), 23/02/2003, France, pp.12-18,
hal-00429845A. Ferreira, S. Pérennes, A. W. Richa, H. Rivano, N. Stier Moses
On the design of multifiber WDM networksAlgotel'02, 05/2002, Mèze, France, pp.25--32,
hal-00429849I. Filali, L. Pellegrino, F. Bongiovanni, F. Huet, F. Baude
Modular P2P-Based Approach for RDF Data Storage and RetrievalAdvances in P2P Systems, 20/11/2011, Lisbonne, Portugal,
inria-00636408I. Filali, F. Huet
Dynamic TTL-Based Search In Unstructured Peer-to-Peer NetworksCCGrid 2010, 17/05/2010, Melbourne, Australie, pp.10 p.,
inria-00485790B. Florent, M. Matamala, N. Nisse, I. Rapaport, K. Suchan, I. Todinca
Reconstruire un graphe en une ronde13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France,
inria-00587250F. V. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, N. Nisse
Satisfaire un internaute impatient est difficile14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2012, La Grande Motte, France, pp....,
hal-00687102F. V. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, N. Nisse
To Satisfy Impatient Web surfers is Hard6th International Conference on FUN with Algorithms (FUN), 2012, Italie, pp.166-176,
hal-00704201F. Fomin, P. Fraigniaud, N. Nisse
Non-Deterministic Graph Searching: From Pathwidth to TreewidthProceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2005, Pologne, pp.364-375,
hal-00421420P. Fraigniaud, N. Nisse
Connected Treewidth and Connected Graph SearchingLatin American Theoretical Informatics Symposium (LATIN), 2006, Valdivia, Chili,
inria-00423448P. Fraigniaud, N. Nisse
Monotony Properties of Connected Visible Graph SearchingInternational Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2006, Bergen, Norvège,
inria-00423449K. Garcés, J. Deantoni, F. Mallet
A Model-Based Approach for Reconciliation of Polychronous Execution TracesSEAA 2011 - 37th EUROMICRO Conference on Software Engineering and Advanced Applications, 30/08/2011, Oulu, Finlande,
inria-00597981R. Gascon, F. Mallet, J. Deantoni
Logical time and temporal logics: comparing UML MARTE/CCSL and PSL18th International Symposium on Temporal Representation and Reasoning (TIME'11), 12/09/2011, Lubeck, Allemagne, pp.--,
hal-00597086N. Gaspar, E. Madelaine
Fractal à la CoqConférence en IngénieriE du Logiciel, 19/06/2012, Rennes, France,
hal-00725291P. Giabbanelli, D. Mazauric, S. Pérennes
Computing the average path length and a label-based routing in a small-world graph12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France, pp.TBA,
inria-00472215F. Giroire, J. Moulierac, T. K. Phan, F. Roudaut
Minimization of Network Power Consumption with Redundancy EliminationInternational IFIP TC 6 Networking Conference, 21/05/2012, Prague, Tchèque, République, NETWORKING 2012, 7289, pp.247-258, Lecture Notes in Computer Science,
hal-00721855F. Giroire, D. Mazauric, J. Moulierac
Routage efficace en énergie13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France,
inria-00587944F. Giroire, D. Mazauric, J. Moulierac, B. Onfroy
Minimizing Routing Energy Consumption: from Theoretical to Practical ResultsIEEE/ACM International Conference on Green Computing and Communications (GreenCom), 18/12/2010, Hangzhou, Chine, pp.8,
hal-00531468F. Giroire, J. Monteiro, S. Pérennes
Peer-to-Peer Storage Systems: a Practical Guideline to be LazyIEEE Global Communications Conference (GlobeCom), 12/2010, Miami, États-Unis,
inria-00496221F. Giroire, J. Monteiro, S. Pérennes
P2P Storage Systems: How Much Locality Can They Tolerate?IEEE Conference on Local Computer Networks (LCN), 10/2009, Zurich, Suisse, pp.320--323,
inria-00496220F. Giroire, J. Chandrashekar, N. Taft, E. Schooler, K. Papagiannaki
Exploiting Temporal Persistence to Detect Covert Botnet ChannelsThe 12th International Symposium on Recent Advances in Intrusion Detection (RAID'09), 23/09/2009, Saint Malo, France, pp.326--345,
inria-00546874C. Glitia, J. Deantoni, F. Mallet
Logical time at work: capturing data dependencies and platform constraintsForum for Design Languages (FDL), 14/09/2010, Southampton, Royaume-Uni, Proceedings of the 2010 Forum on specification & Design Languages, pp.240-246,
inria-00545866A. Goknil, M.-A. Peraldi-Frati
A DSL for Specifying Timing RequirementsMoDRE- 2sd International Model-Driven Requirements Engineering (MoDRE) Workshop, 24/09/2012, Chicago, États-Unis, pp.49-57,
hal-00757168A. Goldman, P. Floriano, A. Ferreira
A tool for obtaining information on DTN traces4th Extreme Conference on Communication (ExtremeCom 2012), 10/03/2012, Zurich, Suisse, pp.6,
hal-00742993C. Gomes, S. Pérennes, H. Rivano
Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks4th IEEE Workshop on Broadband Wireless Access (BWA), 04/12/2008, New-Orleans, US, France, pp.--,
hal-00371144C. Gomez, J. Deantoni, F. Mallet
Multi-View Power Modeling based on UML, MARTE and SysMLSEAA - 38th Euromicro Conference on Software Engineering and Advanced Applications, 05/09/2012, Cesme, Turquie, pp.17-20,
hal-00720735D. Gonçalves, F. Havet, A. Pinlou, S. Thomassé
Spanning galaxies in digraphsEuropean Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), 07/09/2009, Bordeaux, France, 34, pp.139-143, Electronic Notes in Discrete Mathematics,
lirmm-00433050N. Hanusse, D. Ilcinkas, A. Kosowski, N. Nisse
Comment battre la marche aléatoire en comptant ?12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France,
inria-00475863N. Hanusse, D. Ilcinkas, A. Kosowski, N. Nisse
Locating a Target with an Agent Guided by Unreliable Local AdvicePODC 2010, 07/2010, Zurich, Suisse, pp.355-364,
hal-00516695F. Havet, J. Bang-Jensen, N. Trotignon
Finding an induced subdivision of a digraphVI Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2011), 04/2011, Bariloche, Argentine, 37, pp.09--14,
inria-00638464F. Havet, L. Sampaio
On the Grundy number of a graphFifth International Symposium on Parameterized and Exact Computation (IPEC 2010), 13/12/2010, Chennai, Inde, Parameterized and Exact Computation, 6478, pp.170--179,
inria-00532906F. Havet, B. Reed, J.-S. Sereni
L(2,1)-labelling of graphsACM-SIAM symposium on Discrete algorithms (SODA 2008), 20/01/2008, San Francisco, California, États-Unis, pp.621-630,
inria-00486183L. Henrio, F. Huet, Z. István, G. Sebestyén
Adapting Active Objects to Multicore ArchitecturesISPDC, 06/07/2011, Cluj, Roumanie,
hal-00644169L. Henrio, M. U. Khan
Asynchronous Components with Futures: Semantics and Proofs in Isabelle/HOL7th International Workshop on Formal Engineering approaches to Software Components and Architectures, 27/03/2010, Paphos, Chypre, pp.1-20,
inria-00462325L. Henrio, F. Kammüller, M. U. Khan
A Framework for Reasoning on Component CompositionFMCO, 04/11/2009, Eindhoven, Pays-Bas,
inria-00490380L. Henrio, M. U. Khan, N. Ranaldo, E. Zimeo
First Class Futures: Specification and implementation of Update StrategiesCoreGRID/ERCIM Workshop on Grids, Clouds and P2P Computing, 31/08/2010, Ischia - Naples, Italie, Euro-Par 2010 - Parallel Processing Workshops VHPC, HeteroPar, HPPC, HiBB, CoreGrid, UCHPC, HPCF, XtreemOS, PROPER, and CCPI,
inria-00544594L. Henrio, F. Kammüller, M. Rivera
An Asynchronous Distributed Component Model and Its SemanticsFMCO - 08, 2008, Sophia antiopolis, France,
inria-00435145L. Henrio, F. Kammüller
Functional Active Objects: Typing and FormalisationFoundations of Coordination Languages and Software Architectures (FOCLASA'09), 2010, France, pp.83-101,
hal-00485759F. Hermenier, R. Robert
How To Build a Better Testbed: Lessons From a Decade of Network Experiments on EmulabTridentCom, 06/2012, Thessalonique, France, pp.1--17,
hal-00710449B. Jaumard, N. Nahar Bhuiyan, S. Sebbah, F. Huc, D. Coudert
A New Framework for Efficient Shared Segment Protection Scheme for WDM Networks11th International Conference on High Performance Switching and Routing (HPSR), 13/06/2010, Richardson, Texas, USA, Canada, pp.8,
inria-00482119B. Jaumard, N. Nahar Bhuiyan, S. Sebbah, F. Huc, D. Coudert
A New Framework for Efficient Shared Segment Protection Scheme for WDM Networks10th INFORMS Telecommunications Conference, 05/05/2010, Montréal, Canada,
inria-00482121A. Kosowski, B. Li, N. Nisse, K. Suchan
$k$-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2012, La Grande Motte, France, pp....,
hal-00687120A. Kosowski, B. Li, N. Nisse, K. Suchan
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth39th International Colloquium on Automata, Languages and Programming (ICALP), track C, 2012, Royaume-Uni, pp.610-622,
hal-00704202S. Kuntz, M.-A. Peraldi-Frati, H. Blom, K. Daniel
Timing Modeling with AUTOSAR. Current State and Future DirectionsDATE 2012. Design Automation & Test in Europe, 12/03/2012, Dresden, Allemagne,
hal-00667070J.-F. Le Tallec, R. De Simone
SCIPX: a SystemC to IP-XACT extraction toolESLsyn : Electronic System Level Synthesis Conference, 04/06/2011, San Diego, États-Unis,
inria-00601843J.-F. Le Tallec, J. Deantoni, R. De Simone, B. Ferrero, F. Mallet, L. Maillet-Contoz
Combining SystemC, IP-XACT and UML/MARTE in model-based SoC designWorkshop on Model Based Engineering for Embedded Systems Design (M-BED 2011), 18/03/2011, Grenoble, France,
inria-00601840S.-Y. Lee, F. Mallet, R. De Simone
Dealing with AADL end-to-end Flow Latency with UML Marte.ICECCS - UML&AADL, 02/04/2008, Belfast, Irlande, pp.228-233,
inria-00371400M. Leyton, L. Henrio, J. Piquer
Exceptions for Algorithmic Skeletons16th Int. European Conference on Parallel and Distributed Computing (Euro-Par 2010), 2010, Italie, pp.??,
hal-00486108Z. Liu, J. Liu, J. He, F. Mallet, Z. Miaomiao
Formal Specification of Hybrid MARTE StatechartsSixth International Symposium on Theoretical Aspects of Software Engineering, 07/2012, Beijing, Chine,
hal-00764044S. Malik, F. Huet, D. Caromel
Latency Based Dynamic Grouping Aware Cloud Scheduling26th IEEE International Conference on Advanced Information Networking and Applications Workshops, 26/03/2012, Fukuoka, Japon, pp.1190 - 1195,
hal-00711237S. Malik, F. Huet
Virtual Cloud: Rent Out the Rented Resources6th IEEE International Conference for Internet Technology and Secured Transactions (ICITST-2011), 11/12/2011, Abu Dhabi, Émirats Arabes Unis,
hal-00641398S. Malik, F. Huet
Adaptive Fault Tolerance in Real Time Cloud Computing2011 IEEE World Congress on Services, 04/07/2011, Washington DC, États-Unis, 2011 IEEE World Congress on Services (SERVICES 2011), pp.280-287,
hal-00639904F. Mallet
Automatic Generation of Observers from MARTE/CCSLRSP 2012 - International Symposium on Rapid System Prototyping, 11/10/2012, Tampere, Finlande,
hal-00764066F. Mallet, F. Lagarde, C. André, S. Gérard, F. Terrier
An Automated Process for Implementing Multilevel Domain ModelsSoftware Language Engineering, 05/10/2009, Denver, Colorado, États-Unis, pp.314-333, Lecture Note in Computer Sciences,
inria-00464880F. Mallet, C. André, J. Deantoni
Executing AADL models with UML/MarteInt. Conf. Engineering of Complex Computer Systems - ICECCS'09, 02/06/2009, Potsdam, Allemagne, pp.pp. 371-376,
inria-00416592F. Mallet, C. André
On the semantics of UML/Marte Clock ConstraintsInt. Symp. on Object/component/service-oriented Real-time distributed Computing (ISORC'09), 03/2009, Tokyo, Japon, pp.301-312,
inria-00383279F. Mallet, M.-A. Peraldi-Frati, C. André
Marte CCSL to execute East-ADL Timing RequirementsInt. Symp. on Object/component/service-oriented Real-time distributed Computing (ISORC'09), 03/2009, Tokyo, Japon, pp.249-253,
inria-00383262F. Mallet, R. De Simone, L. Rioux
Event-based vs. Time-Triggered Communications with UML MarteForum on specification, verification & Design Languages (FDL'08), 23/09/2008, Stuttgart, Allemagne, pp.154-159,
inria-00371392F. Mallet, R. De Simone
MARTE: A Profile for RT/E Systems Modeling, Analysis (and Simulation?)First International Conference on Simulation Tools and Techniques for Communications, Networks and Systems SIMUTools'08, 03/03/2008, Marseille, France, pp.1-8,
inria-00371397F. Mallet, M.-A. Peraldi-Frati, C. André
From UML to Petri Nets for non functional Property VerificationIEEE International Symposium on Industrial Embedded Systems, 2006. IES '06., 18/10/2006, Sophia antipolis, France,
inria-00371277E. P. Mancini, G. Wainer, K. Al-Zoubi, O. Dalle
Simulation in the Cloud Using Handheld DevicesMSGC@CCGRID - Workshop on Modeling and Simulation on Grid and Cloud Computing - 2012, 13/05/2012, Ottawa, Canada, pp.867 -872,
hal-00691248J.-C. Maureira, P. Uribe, O. Dalle, J. Anaya, T. Asahi
Component based approach using OMNeT++ for Train Communication ModelingITS-T 2009, 19/10/2009, Lille., France,
inria-00501882J.-C. Maureira, O. Dalle, D. Dujovne
Generation of Realistic 802.11 Interferences in the Omnet++ INET Framework Based on Real Traffic MeasurementsOMNeT++ Workshop / SIMUTools 2009, 06/03/2009, Rome, Italie,
inria-00501885C. Molle, F. Peix, S. Pérennes, H. Rivano
Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Informationthe fourth Symposium on Trustworthy Global Computing (TGC 2008), 11/2008, Barcelona, Espagne, 5474, pp.171-185, LNCS,
hal-00429827J. Monteiro, S. Pérennes
Systèmes de stockage P2P : un guide pratiqueJDIR, 2010, Sophia Antipolis, France,
inria-00483214N. Nisse, I. Rapaport, K. Suchan
Distributed computing of efficient routing schemes in generalized chordal graphsInternational Colloquium on Structural Information and Communication Complexity (SIROCCO), 2009, Piran, Slovénie,
inria-00423454N. Nisse, K. Suchan
Fast Robber in Planar GraphsInternational Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2008, Durham, Royaume-Uni,
inria-00423451N. Nisse, D. Soguet
Graph Searching with adviceInternational Colloquium on Structural Information and Communication Complexity (SIROCCO), 2007, Castiglioncello, Italie,
inria-00423450M.-A. Peraldi-Frati, A. Goknil, M. Adedjouma, P.-Y. Gueguen
Modeling a BSG-E Automotive System with the Timing Augmented Description language.ISOLA 2012 -5th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation, 13/10/2012, Amirandes, Héraklion, Grèce, Isola 2012 Proceedings, 7610, pp.111-125, Lecture Notes in Computer Science,
hal-00757185M.-A. Peraldi-Frati, A. Goknil, J. Deantoni, J. Nordlander
A timing model for specifying multi clock automotive systems. The Timing Augmented Description Language V2ICECCS 2012 : International Conference on Engineering of Complex Computer Systems, 18/07/2012, Paris, France, Proceeding of the 17th ICECCS conference, pp.10 pages,
hal-00687562M.-A. Peraldi-Frati, D. Karlsson, A. Hamann, S. Kuntz, J. Nordlander
The TIMMO-2-USE project: Time modeling and analysis to useERTS2012 International Congres on Embedded Real Time Software and Systems, 01/02/2012, Toulouse, France, 6th International Congres on Embedded Real Time Software and Systems,
hal-00649781M.-A. Peraldi-Frati, J. Deantoni
Scheduling Multi Clock Real Time Systems: From Requirements to ImplementationInternational Symposium on Object/Component/Service-oriented Real-time Distributed Computing, 28/03/2011, Newport Beach, États-Unis, IEEE international Symposium on Object/Component/service Oriented Real-Time Distributed Computing, pp.50; 57,
inria-00586851M.-A. Peraldi-Frati, A. ALBINET
Requirement traceability in safety critical systemsEDCC2010 - Workshop on Critical Automotive applications: Robustness and Safety (CARS'2010), 26/04/2010, Valencia, Espagne, Proceeding of the 1st Workshop on Critical Automotive applications: Robustness & Safety, pp.11-14, ACM International Conference Proceeding Series,
hal-00687550M.-A. Peraldi-Frati, H. Dubois, F. Lakhal
A Model for Requirements Traceability in an Heterogeneous Model-Based Design Process : Application to Automotive Embedded SystemsICECCS 2010 : 15th International Conference on Engineering of Complex Computer Systems, 22/03/2010, Oxford, Royaume-Uni, Proceedings of 15th IEEE International Conference on Engineering of Complex Computer Systems, pp.233-242,
hal-00687581K. Phan, J. Moulierac, C. Ngoc Tran, N. Thoai
Xcast6 Treemap Islands - Revisiting Multicast ModelACM CoNEXT Student Workshop, 10/12/2012, Nice, France,
hal-00749266D. Potop-Butucaru, R. De Simone, Y. Sorel, J.-P. Talpin
Clock-Driven Distributed Real-Time Implementation of Endochronous Synchronous ProgramsInternational conference on Embedded software - EMSOFT 2009, 12/10/2009, Grenoble, France,
inria-00485007D. Potop-Butucaru, R. De Simone
Optimizations for faster execution of Esterel programsFormal Methods and Models for Codesign (MEMOCODE'2003), 24/06/2003, Mont Saint-Michel, France, pp.227-236 - ISBN 0-7695-1923-7,
hal-00618104J. Ribault, O. Dalle, D. Conan, S. Leriche
OSIF: A Framework To Instrument, Validate, and Analyze SimulationsSIMUTools2010, 16/03/2010, Torremolinos, Espagne,
inria-00465141J. Ribault, F. Peix, J. Monteiro, O. Dalle
OSA: an Integration Platform for Component-Based SimulationSecond Intl. Conf. on Simulation Tools and Techniques (SIMUTools09), 02/03/2009, Rome, Italie,
inria-00449632J. Ribault, O. Dalle
OSA : A Federative Simulation PlatformProceedings of the Winter Simulation Conference (WSC'09), 13/12/2009, Austin, États-Unis,
inria-00449642J. Ribault, O. Dalle
Enabling advanced simulation scenarios with new software engineering techniques.20th European Modeling and Simulation Symposium (EMSS 2008), 17/09/2008, Briatico, Italie,
inria-00425150F. Solano Donado, J. Moulierac
Routing in All-Optical Label Switched-based Networks with Small Label SpacesIFIP/IEEE ONDM, 18/02/2009, Braunschweig, Allemagne,
inria-00425298E. Tanter, J. Noyé, D. Caromel, P. Cointe
Partial Behavioral Reflection: Spatial and Temporal Selection of ReificationThe 18th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (OOPSLA 2003), 2003, Anaheim, California, USA, États-Unis, pp.27-46,
hal-00457204P. Uribe, J.-C. Maureira, O. Dalle
Extending INET Framework for Directional and Asymmetrical Wireless CommunicationsICST 3rd International Workshop on OMNeT++, 15/03/2010, Torremolinos, Espagne, pp.8p,
inria-00530809C. Xiaohong, J. Liu, F. Mallet, Z. Jin
Modeling Timing Requirements in Problem Frames Using CCSLAPSEC 2011 - 18th Asia Pacific Software Engineering Conference, 05/12/2011, Ho Chi Minh, Viet Nam, pp.381-388,
hal-00809644L. Yin, F. Mallet, J. Liu
Verification of MARTE/CCSL Time Requirements in Promela/SPINIEEE ICECCS 2011 - 16th IEEE International Conference on Engineering of Complex Computer Systems, 27/04/2011, Las Vegas, États-Unis,
hal-00650621H. Yu, J.-P. Talpin, L. Besnard, T. Gautier, F. Mallet, C. André, R. De Simone
Polychronous Analysis of Timing Constraints in UML MARTEIEEE International Workshop on Model-Based Engineering for Real-Time Embedded Systems Design, 05/2010, Parador of Carmona, Espagne, pp.7 p.,
inria-00497249
COMMUNICATIONS NATIONALES
O. Amini, S. Pérennes, I. Sau
Hardness of Approximating the Traffic Grooming Problem9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, 05/2007, Ile d'Oléron, France, pp.45-48,
inria-00176960C. André, M. Belaunde, B. Berthomieu, C. Brunette, A. Canals, H. Garavel, S. Graf, F. Lang, V. Mahé, M. Nakhlé, R. Schnekenburger, R. De Simone, J.-P. Talpin, F. Vernadat
Présentation des résultats du projet OpenEmbeDDNeptune, 05/2009, Paris, France,
inria-00381639I. Attali, D. Caromel, L. Henrio, F. Luna
Secured Information Flow for Asynchronous Sequential Processes3rd International Workshop on Security Issues in Concurrency (SecCo'05), 08/2005, San Francisco, USA,
inria-00122937I. Attali, T. Barros, E. Madelaine
Formalisation and Proofs of the Chilean Electronic Invoices Systemin proc. of the XXIV International Conference of the Chilean Computer Science Society (SCCC'04), 10/2004, Arica, Chili,
inria-00087210T. Barros, A. Cansado, E. Madelaine, M. Rivera
Model-checking Distributed Components: The Vercors PlatformFormal Aspect of Component Systems, 09/2006, Prague / Tcheque republic,
inria-00091569T. Barros, L. Henrio, E. Madelaine
Behavioural Models for Hierarchical ComponentsSPIN'05, 2005, San Francisco, USA,
inria-00122933T. Barros, L. Henrio, E. Madelaine
Verification of Distributed Hierarchical ComponentsInternational Workshop on Formal Aspects of Component Software (FACS'05), 2005, Macao,
inria-00122926T. Barros, R. Boulifa, E. Madelaine
Parameterized Models for Distributed Java ObjectsForte'04 conference, 09/2004, Madrid, LNCS 3235,
inria-00087222F. Baude, D. Caromel, A. Di Costanzo, C. Delbe, M. Leyton
Towards Deployments Contracts in Large Scale Clusters & Desktop GridsWorkshop on Large-Scale and Volatile Desktop Grids (PCGrid 2007), 03/2007, Long Beach, California, États-Unis,
hal-00128513J.-C. Bermond, F. Havet, F. Huc, C. Linhares-Sales
Allocation de fréquences et coloration impropre des graphes hexagonaux pondérés9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, 05/2007, Ile d'Oléron, France, pp.53-56,
inria-00176955J.-C. Bermond, J. Galtier, R. Klasing, N. Morales, S. Pérennes
Gathering in specific radio networks8èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel06), Trégastel, 05/2006, France, pp.85--88,
hal-00344620J.-C. Bermond, O. Delmas, F. Havet, M. Montassier, S. Pérennes
Réseaux de télécommunication minimaux embarqués tolérants aux pannes5ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (ALGOTEL 2003), 12/05/2003, France, pp.27--32,
hal-00307610J.-C. Bermond, L. Chacon, D. Coudert, F. Tillerot
Conception d'un réseau WDM protégé par sous-réseaux2ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'00), 10/05/2000, La Rochelle, France, ISBN 2-7261-1157-2, pp.83-88,
inria-00429292M. Bouklit, D. Coudert, J.-F. Lalande, H. Rivano
Approximation Combinatoire de Multiflot Factionnaire : AméliorationsAlgoTel'03 : 5ièmes Rencontres Francophones sur les Aspects ALGOrithmiques des TELécommunications, Banyuls-sur-Mer (France), pp.P nd.,
lirmm-00269814J. Bustos-Jimenez, D. Caromel, A. Di Costanzo, M. Leyton, J. M. Piquer
Balancing Active Objects on a Peer to Peer InfrastructureProceedings of the XXV International Conference of the Chilean Computer Science Society (SCCC 2005), 11/2005, Valdivia, Chile,
inria-00001237D. Caromel, V. Cavé, A. Di Costanzo, C. Brignolles, B. Grawitz, Y. VIALA
Executing Hydrodynamic Simulation on Desktop Grid with ObjectWeb ProActiveHIC2006: Proceedings of the 7th International Conference on HydroInformatics, 04/09/2006, Nice, France,
inria-00068176D. Caromel, C. Delbé, A. Di Costanzo, M. Morel
Dynamically-Fulfilled Application Constraints through Technical Services - Towards Flexible Component DeploymentsProceedings of HPC-GECO/CompFrame 2006, HPC Grid programming Environments and COmponents - Component and Framework Technology in High-Performance and Scientific Computing, 19/06/2006, Paris, France,
inria-00068595D. Caromel, C. Delbe, A. Di Costanzo
Peer-to-Peer and Fault-Tolerance: Towards Deployment Based Technical ServicesSecond CoreGRID Workshop on Grid and Peer to Peer Systems Architecture, 01/2006, Paris, France,
inria-00001238D. Caromel, Ludovic Henrio
Asynchonous Distributed Components: Concurrency and DeterminacyTheoretical Computer Science 2006 (IFIP TCS'06), 2006, Santiago, Chile,
inria-00122924D. Caromel, A. Di Costanzo, D. Gannon, A. Slominski
Asynchronous Peer-to-Peer Web Services and FirewallsIPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5, 03/04/2005, Washington, DC, États-Unis, pp.183.1,
inria-00001236D. Coudert, F. Huc, D. Mazauric
Algorithme générique pour les jeux de capture dans les arbres10ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08), 2008, Saint-Malo, France, pp.37-40,
inria-00374452D. Coudert, S. Pérennes, Q.-C. Pham, J.-S. Sereni
Rerouting requests in WDM networks7eme Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), 05/2005, Presqu'île de Giens, France, pp.17-20,
inria-00429173D. Coudert, H. Rivano
Routage optique dans les réseaux WDM multifibres avec conversion partielleQuatrièmes Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), 22/05/2002, Mèze, France, pp.17-24,
inria-00429178D. Coudert
Chemins disjoints de poids minimum pour la sécurisation de réseaux de télécommunications3eme Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 28/05/2001, Saint Jean de Luz, France, pp.47-53,
inria-00429185D. Coudert, A. Ferreira, S. Pérennes
Theoretical Aspects of the Optical Transpose Interconnecting System ArchitecturePremière Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), 05/05/1999, Roscoff, France, pp.101-106,
inria-00429194O. Dalle
Component-based Discrete Event Simulation Using the Fractal Component ModelInternational Conference on AI, Simulation and Planning in High Autonomy Systems (AIS) and Conceptual Modeling and Simulation (CMS), 08/02/2007, Buenos Aires, Argentina, pp.213--218,
inria-00141624O. Dalle
OSA: an Open Component-based Architecture for Discrete-event Simulationproc. of 20th European Conf. on Modeling and Simulation, 28/05/2006, Bonn, Germany, Allemagne, pp.253--259,
inria-00141606J. Deantoni, J.-P. Babau
Model driven engineering method for SAIA architecture designIngénierie Dirigée par les Modèles, 27/06/2006, Lille, France,
inria-00587200F. Fomin, P. Fraigniaud, N. Nisse
Strategies d'encerclement non deterministes8èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2006, France, pp.81-84,
hal-00421419P. Fraigniaud, N. Nisse
Stratégies d'encerclement connexes dans un réseau7èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2005, France, pp.13-16,
hal-00421418F. Giroire, F. Guinand, L. Lefèvre, J. Torres
Energy-aware, power-aware, and Green Computing for large distributed systems and applicationsProceedings of the 2010 International Conference on High Performance Computing & Simulation (HPCS), 2010, Caen, France, Inconnu,
hal-00794907C. Gomes, S. Pérennes, P. Reyes, H. Rivano
Bandwidth Allocation in Radio Grid Networks10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08), 13/05/2008, Saint Malo, France, pp.--,
hal-00371137C. Gomez, J. Deantoni, F. Mallet
Semantic Multi-View model for Low-PowerJournées nationales IDM, CAL, et du GDR GPL, 07/06/2011, Lille, France, pp.19,
hal-00596239F. Havet, C. Linhares Sales
Combinatória e Problemas em Redes de TelecomunicaçõesColloque dÍnformatique: Brésil / INRIA, Coopérations, Avancées et Défis, 2009, Bento Gonçãlves, Brésil, pp.4p,
hal-00795280L. Henrio, E. Madelaine
Experiments with distributed Model-Checking of group-based applicationsSophia-Antipolis Formal Analysis Workshop, 06/10/2010, Sophia-Antipolis, France, pp.3p.,
inria-00538499L. Henrio, F. Kammüller
A Mechanized Model of the Theory of Objects9th IFIP International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS), 06/06/2007, CYPRUS,
inria-00150272F. Hermenier, J. L. Lawall, J.-M. Menaud, G. Muller
Consolidation dynamique d'applications Web haute-disponibilitéCFSE - 8ème Conférence Francophone sur les Systèmes d'Exploitation, 10/05/2011, St Malo, France,
hal-00750067J.-F. Lalande, M. Syska, Y. Verhoeven
Arrondi aléatoire et protection des réseaux WDMROADEF 2005, 14/02/2005, Tours, France, ROADEF 2005 / 6ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, pp.241-242,
inria-00451818J.-F. Lalande, S. Pérennes, M. Syska
Groupage dans les réseaux dorsaux WDMROADEF 2003, 26/02/2003, Avignon, France, pp.254-255,
inria-00451812R. Le Riche, D. Caromel, R. Duvigneau
Optimization tools and applications developed during the OMD & OMD2 projectsForum Teratech 2011, Complex systems engineering workshop (atelier ingénierie des systèmes complexes), 29/06/2011, Palaiseau, France,
emse-00686596C. Molle, F. Peix, S. Pérennes, H. Rivano
Formulation en Coupe/Rounds pour le Routage dans les réseaux radio maillés10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications, 13/05/2008, St Malo, France, pp.97--100,
hal-00293288
OUVRAGES DE SYNTHESE
D. Coudert, D. Simplot-Ryl
Ad Hoc & Sensor Wireless Networks, an International Journal -- Special issue on Ad hoc, Mobile and Wireless NetworksCoudert, D. and Simplot-Ryl, D., Old City Publishing, 2010,
inria-00531585O. Dalle, G. Wainer
SIMULATION: Transactions of the Society of Modeling and Simulation International. Special Issue on Software Tools, Techniques and Architectures for Computer SimulationOlivier Dalle and Gabriel Wainer, Sage, 2010,
hal-00794908F. Mallet
Logical Time @ Work for the Modeling and Analysis of Embedded SystemsLAP LAMBERT Academic Publishing, 19/01/2011, 978-3-8433-9388-1
inria-00561247
DIRECTION D'OUVRAGES
O. Dalle, F. Perrone, G. Stea, G. Wainer
2nd International Conference on Simulation Tools and Techniques (SIMUTools 2009)Dalle, Olivier and Perrone, Felipe and Stea, Giovanni and Wainer, Gabriel, ACM, 2009,
hal-00795278F. Giroire, D. Mazauric
11emes Journées Doctorales en Informatique et Réseaux (JDIR 2010)Frédéric Giroire and Dorain Mazauric, Mascotte, INRIA, I3S(CNRS / Univ. of Nice-Sophia, 2010, Journées Doctorales en Informatique et Réseaux,
hal-00794827E. Madelaine, M. Lumpe
Proceedings of the 4th International Workshop on Formal Aspects of Component SoftwareEric Madelaine and Markus Lumpe, ENTCS, 2008,
inria-00337975
CHAPITRE D'OUVRAGES
G. A. Wainer, K. Al-Zoubi, O. Dalle, S. Mittal, J. L. Risco Martin, H. Sarjoughian, L. Touraille, M. K. Traoré, B. P. Zeigler, D. Hill
Chapter 17: Standardizing DEVS model representationin Discrete-Event Modeling and Simulation: Theory and ApplicationsWainer, G. and Mosterman, P., CRC press, 2011, 978-1-4200-7233-4
inria-00638560G. A. Wainer, K. Al-Zoubi, O. Dalle, S. Mittal, J. L. Risco Martin, H. Sarjoughian, L. Touraille, M. K. Traoré, B. P. Zeigler, D. Hill
Chapter 18: Standardizing DEVS Simulation Middlewarein Discrete-Event Modeling and Simulation: Theory and ApplicationsWainer, G. and Mosterman, P., CRC press, 2011, 978-1-4200-7233-4
inria-00638559B. Amedro, F. Baude, D. Caromel, C. Delbé, I. Filali, F. Huet, E. Mathias, O. Smirnov
An efficient framework for running applications on clusters, grids, and cloudsin Cloud ComputingNick Antonopoulos and Lee Gillam, Springer, 2010, Computer Communications and Networks, 978-1849962407
hal-00694011C. André, J. Deantoni, F. Mallet, R. De Simone
The Time Model of Logical Clocks available in the OMG MARTE profilein Synthesis of Embedded Software: Frameworks and Methodologies for Correctness by ConstructionSandeep K. Shukla and Jean-Pierre Talpin, Springer Science+Business Media, LLC 2010, 07/2010, 978-1-4419-6399-4
inria-00495664C. André, F. Mallet, R. De Simone
Modeling AADL data-communications with UML MARTEin Embedded Systems Specification and Design LanguagesEugenio villar, Springer, 2008, Lecture Notes in Electrical Engineering, 978-1-4020-8296-2
inria-00371366L. Baduel, F. Baude, D. Caromel, A. Contes, F. Huet, M. Morel, R. Quilici
Programming, Composing, Deploying for the Gridin Grid Computing: Software Environments and ToolsCunha, Jose C.; Rana, Omer F., Springer, 2006, 978-1-85233-998-2
inria-00486114J.-C. Bermond, F. Ergincan, M. Syska
Line Directed Hypergraphsin Cryptoquater2011 ,Festchrift Jean-jacques,Springer verlag, 2011, Lecture Notes in Computer Science, 6805,,
hal-00643785J.-C. Bermond, D. Coudert
Groomingin Handbook of Combinatorial Designs (2nd edition)Charles J. Colbourn and Jeffrey H. Dinitz, Chapman & Hall- CRC Press, 2006, Discrete mathematics and Applications, 1584885068
inria-00429215J.-C. Bermond, D. Coudert
Groomingin Handbook of Combinatorial DesignsC.J. Colbourn and J.H. Dinitz, Chapman & Hall- CRC Press, 2006, Discrete mathematics and Applications,
inria-00531339J. Boucaron, A. Coadou, R. De Simone
Formal Modeling of Embedded Systems with Explicit Schedules and Routesin Synthesis of Embedded Software: Frameworks and Methodologies for Correctness by ConstructionSandeep K. Shukla and Jean-Pierre Talpin, Springer Science+Business Media, LLC 2010, 07/2010, 978-1-4419-6399-4
inria-00495667T. Cinkler, D. Coudert, M. Flammini, G. Monaco, L. Moscardelli, X. Muñoz, I. Sau, M. Shalom, S. Zaks
Traffic Grooming: Combinatorial Results and Practical Resolutions.in Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks.Arie Koster and Xavier Muñoz, Springer, 01/01/2010, EATCS Texts in Theoretical Computer Science, 978-3-642-02249-4
inria-00530964D. Coudert, X. Munoz
Graph Theory and Traffic Grooming in WDM Ringsin Recent Research Developments in OpticsS.G. Pandalai, Research Signpost, 2003, 81-271-0028-5
inria-00429212F. Giroire, D. Mazauric, J. Moulierac
Energy Efficient Routing by Switching-Off Network Interfacesin Energy-Aware Systems and Networking for Sustainable InitiativesNaima Kaabouch and Wen-Chen Hu, IGI Global, 2012,
hal-00759894C. Glitia, J. Deantoni, F. Mallet
Logical Time @ Work: Capturing Data Dependencies and Platform Constraintsin System Specification and Design LanguagesKaźmierski, Tom J. J. and Morawiec, Adam, Springer New York, 2012, Lecture Notes in Electrical Engineering, 978-1-4614-1426-1
hal-00651864F. Mallet, R. De Simone
MARTE vs. AADL for Discrete-Event and Discrete-Time Domainsin Languages for Embedded Systems and their ApplicationsMartin Radetzki, Springer, 05/2009, Lecture Notes in Electrical Engineering, 978-1-4020-9713-3
inria-00416656D. Potop-Butucaru, R. De Simone, Y. Sorel
From Synchronous Specifications to Statically-Scheduled Hard Real-Time Implementationsin Synthesis of Embedded Software: Frameworks and Methodologies for Correctness by ConstructionSandeep K. Shukla and Jean-Pierre Talpin, Springer Science+Business Media, LLC 2010, 07/2010, 978-1-4419-6399-4
inria-00495666D. Potop-Butucaru, R. De Simone, J.-P. Talpin
Synchronous hypothesis and polychronous languagesin Embedded Systems Design and VerificationRichard Zurawski, CRC Press, 2009, 978-1-4398-0755-2
hal-00788473
THESES et HDR
F. Baude
HDR:De la programmation parallèle structurée à la programmation pour la grilleUniversité de Nice Sophia-Antipolis, 15/09/2006,
tel-00507049D. Coudert
HDR:Algorithmique et optimisation dans les réseaux de télécommunicationsUniversité de Nice Sophia-Antipolis, 05/03/2010,
tel-00466400D. Coudert
THESE:Algorithmique et optimisation de réseaux de communications optiquesUniversité de Nice Sophia-Antipolis, 11/12/2001,
tel-00008087O. Dalle
THESE:Techniques et outils pour les communications et la répartition dynamique de charge dans les réseaux de stations de travailinformatique, Université de Nice Sophia-Antipolis, 15/01/1999,
tel-00712754L. Henrio
HDR:Modèles Formels pour la Programmation et la Composition de Systèmes Distribués CorrectsUniversité de Nice Sophia-Antipolis, 19/07/2012,
tel-00720022L. Henrio
THESE:Calcul d'objet asynchrone : confluence et déterminismeinformatique, Université de Nice Sophia-Antipolis, 28/11/2003,
tel-00505940F. Huet
THESE:Objets mobiles : conception d'un middleware et évaluation de la communicationinformatique, Université de Nice Sophia-Antipolis, 11/12/2002,
tel-00505420E. Madelaine
HDR:Specification, Model Generation, and Verification of Distributed ApplicationsUniversité de Nice Sophia-Antipolis, 29/09/2011,
tel-00625248F. Mallet
HDR:Temps Logique pour l'ingénierie dirigée par le modèlesUniversité de Nice Sophia-Antipolis, 26/11/2010,
tel-00541140
RAPPORTS DE RECHERCHE
P. Aboulker, F. Havet, N. Trotignon
On wheel-free graphsRapport de recherche,
inria-00602079L. Addario-Berry, S. Thomassé, F. Havet
Paths with two blocks in $n$-chromatic digraphsRapport de recherche, 09/2005,
inria-00070325L. Addario-Berry, F. Havet, C. Linhares Sales, B. Reed, S. Thomassé
Oriented trees in digraphs.Rapport de recherche,
inria-00551133S. Alouf, F. Huet, P. Nain
Forwarders vs. Centralized Server : An Evaluation of two Approaches for Locating Mobile Agents04/2002,
inria-00072148B. Amedro, V. Bodnartchouk, D. Caromel, C. Delbe, F. Huet, G. Taboada
Current State of Java for HPCRapport Technique, 2008,
inria-00312039R. Ameur-Boulifa, L. Henrio, E. Madelaine, A. Savu
Behavioural Semantics for Asynchronous ComponentsRapport de recherche,
hal-00761073R. Ameur-Boulifa, R. Halalai, L. Henrio, E. Madelaine
Verifying Safety of Fault-Tolerant Distributed Components -- Extended VersionRapport de recherche,
inria-00621264O. Amini, S. Pérennes, I. Sau
Hardness and Approximation of Traffic GroomingRapport de recherche, 06/2007,
inria-00158341O. Amini, F. Havet, F. Huc, S. Thomassé
WDM and Directed Star ArboricityRapport de recherche, 01/2007,
inria-00132396O. Amini, F. Giroire, F. Huc, S. Pérennes
Minimal Selectors and Fault Tolerant NetworksRapport de recherche, 06/2006,
inria-00082015O. Amini, F. Huc, S. Pérennes
On the Pathwidth of Planar GraphsRapport de recherche, 06/2006,
inria-00082035O. Amini, D. Coudert, N. Nisse
Some Results on Non-deterministic Graph Searching in TreesRapport de recherche,
inria-00174965O. Amini, D. Peleg, S. Pérennes, I. Sau Valls, S. Saurabh
Degree-Constrained Subgraph Problems: Hardness and Approximation ResultsRapport de recherche,
inria-00331747C. André
Verification of clock constraints: CCSL Observers in EsterelRapport de recherche, 02/2010,
inria-00458847C. André, F. Mallet, M.-A. Peraldi-Frati
Non-functional property analysis using UML2.0 and model transformationsRapport de recherche, 05/2006,
inria-00124874C. André, A. Cuccuru, R. De Simone, J.-P. Talpin
Modeling with logical time in UML for real-time embedded system designRapport de recherche, 2006,
inria-00071373C. André, F. Mallet
Clock Constraints in UML/MARTE CCSLRapport de recherche,
inria-00280941C. André, F. Mallet
Combining CCSL and Esterel to specify and verify time requirementsRapport de recherche,
inria-00360528C. André, M. Bayart, A.-M. Déplanche, J. Jourdan, M.-A. Péraldi, F. Simonot-Lion, L. Thomas, J. Toussaint, Y. Trinquet
Construction et Validation d'Architectures Distribuées Temps Réel (Consortium COVADIS)Contrat,
inria-00098509C. André
Modèles de temps et de contraintes temporelles de MARTE et leurs applicationsRapport de recherche,
hal-00639211C. André
Syntax and Semantics of the Clock Constraint Specification Language (CCSL)Rapport de recherche,
inria-00384077J. Araujo, F. Giroire, Y. Liu, M. Remigiusz, J. Moulierac
Energy Efficient Content DistributionRapport de recherche,
hal-00743248J. Araujo, J.-C. Bermond, F. Giroire, F. Havet, D. Mazauric, R. Modrzejewski
Weighted Improper ColouringRapport de recherche,
inria-00583036J. Araujo, V. Campos, F. Giroire, N. Nisse, L. Sampaio, R. Soares
On the hull number of some graph classesRapport de recherche,
inria-00576581J. Araújo, N. Cohen, F. Giroire, F. Havet
Good edge-labelling of graphsRapport de recherche, 2009,
inria-00383343M. Aste, F. Havet, C. Linhares-Sales
Grundy number and products of graphsRapport de recherche,
inria-00328589I. Attali, D. Caromel, R. Guider
Static Analysis of Java for Distributed and Parallel Programming03/1999,
inria-00073040I. Attali, D. Caromel, S. O. Ehmety
An Operational Semantics for the Eiffel Language11/1995,
inria-00073962J. Bang-Jensen, F. Havet, A. K. Maia
Finding a subdivision of a digraphRapport de recherche,
hal-00720500J. Bang-Jensen, F. Havet, N. Trotignon
Finding an induced subdivision of a digraphRapport de recherche,
inria-00527518L. Barrière, P. Flocchini, F. V. Fomin, P. Fraigniaud, N. Nisse, N. Santoro, D. M. Thilikos
Connected Graph SearchingRapport de recherche,
inria-00508888T. Barros, L. Henrio, E. Madelaine
Behavioural Models for Hierarchical ComponentsRapport de recherche, 2005,
inria-00070416T. Barros, E. Madelaine
Formalisation and verification of the Chilean electronic invoice system06/2004,
inria-00070777T. Barros, R. Boulifa, A. Cansado, L. Henrio, E. Madelaine
Behavioural Models for Distributed Fractal ComponentsRapport de recherche,
inria-00268965N. Baskiotis, S. Pérennes, H. Rivano
Dimensionnement heuristique des réseaux optiques WDM multifibres par arrondi aléatoire de multiflot03/2002,
inria-00072170F. Baude, D. Caromel, C. Delbé, L. Henrio
A Fault Tolerance protocol for ASP calculus: Design and Proof06/2004,
inria-00070752B. Beauquier, O. Delmas, S. Pérennes
Tight Bounds for Broadcasting in the Linear Cost Model12/1999,
inria-00072831B. Beauquier, S. Pérennes, D. Tóth
All-to-All Routing and Coloring in Weighted Trees of Rings06/1999,
inria-00072968B. Beauquier, P. Hell, S. Pérennes
Optimal Wavelength-Routed Multicasting10/1997,
inria-00073413B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Pérennes, U. Vaccaro
Graph Problems Arising from Wavelength-Routing in All-Optical Networks05/1997,
inria-00073523F. Becker, M. Matamala, N. Nisse, I. Rapaport, K. Suchan, I. Todinca
Adding a referee to an interconnection network: What can(not) be computed in one round.Rapport de recherche,
inria-00528733S. Belhareth, D. Coudert, D. Mazauric, N. Nisse, I. Tahiri
Reconfiguration with physical constraints in WDM networksRapport de recherche,
hal-00654111B. Bennour, L. Henrio, M. Rivera
A Reconfiguration Framework for Distributed ComponentsRapport de recherche,
inria-00379268J.-C. Bermond, D. Coudert, B. Lévêque
Approximations for All-to-all Uniform Traffic Grooming on Unidirectional RingRapport de recherche, 01/10/2007,
inria-00175795J.-C. Bermond, J. Galtier, R. Klasing, N. Morales, S. Pérennes
Hardness and approximation of gathering in static radio networksRapport de recherche, 06/2006,
inria-00081032J.-C. Bermond, L. Braud, D. Coudert
Traffic Grooming on the PathRapport de recherche, 2005,
inria-00070363J.-C. Bermond, M. Cosnard, D. Coudert, S. Pérennes
Optimal Solution of the Maximum All Request Path Grooming ProblemRapport de recherche, 2005,
inria-00070381J.-C. Bermond, F. Havet, C. Tóth
Fault tolerant on-board networks with prioritiesRapport de recherche, 11/2004,
inria-00070640J.-C. Bermond, D. Coudert, M.-L. Yu
On DRC-Covering of K_n by CyclesRapport de recherche, 10/2001,
inria-00072288J.-C. Bermond, N. Marlin, D. Peleg, S. Pérennes
Directed Virtual Path Layouts in ATM Networks04/1999,
inria-00073007J.-C. Bermond, E. Darrot, O. Delmas, S. Pérennes
Hamilton Circuits in the Directed Butterfly Network07/1996,
inria-00073773J.-C. Bermond, E. Darrot, O. Delmas, S. Pérennes
Hamilton Cycle Decomposition of the Butterfly Network06/1996,
inria-00073777J.-C. Bermond, Z. Liu, M. Syska
Mean eccentricities of de Bruijn networksRapport de recherche, 1993,
inria-00074558J.-C. Bermond, D. Coudert, G. D'Angelo, F. Z. Moataz
Diverse Routing with the star propertyRapport de recherche,
hal-00733869J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, H. Rivano, I. Sau, F. Solano Donado
MPLS label stacking on the line networkRapport de recherche,
inria-00354267J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau Valls, F. Solano Donado
GMPLS Routing Strategies based on the Design of Hypergraph LayoutsRapport de recherche,
inria-00360576J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau, F. Solano Donado
GMPLS Label Space Minimization through Hypergraph LayoutsRapport de recherche,
inria-00426681J.-C. Bermond, D. Coudert, J. Peters
Online Distributed Traffic Grooming on Path NetworksRapport de recherche,
inria-00359810J.-C. Bermond, F. Havet, F. Huc, C. Linhares Sales
Improper colouring of weighted grid and hexagonal graphsRapport de recherche,
inria-00472819J.-C. Bermond, M. Cosnard, S. Pérennes
Directed acyclic graphs with the unique dipath propertyRapport de recherche,
inria-00387085J.-C. Bermond, N. Nisse, P. Reyes, H. Rivano
Fast Data Gathering in Radio Grid NetworksRapport de recherche,
inria-00363908P. Berthomé, N. Nisse
A unified FPT Algorithm for Width of Partition FunctionsRapport de recherche,
inria-00321766S. Bessy, E. Birmelé, F. Havet
Arc-chromatic number of digraphs in which each vertex has bounded outdegree or bounded indegreeRapport de recherche, 11/2004,
inria-00070639S. Bessy, F. Havet, J. Palaysi
Choosability of bipartite graphs with maximum degree $Delta$07/2002,
inria-00072066S. Bessy, F. Havet
Enumerating the edge-colourings and total colourings of a regular graphRapport de recherche,
inria-00602188S. Bhadra, A. Ferreira
Computing multicast trees in dynamic networks using evolving graphs08/2002,
inria-00072057L. Blin, J. Burman, N. Nisse
Perpetual Graph Searching02/2012,
hal-00675233F. Bongiovanni, L. Henrio
Mechanical Support for Efficient Dissemination on the CAN Overlay NetworkRapport de recherche, 04/2011,
inria-00585057J. Boucaron, A. Coadou, R. De Simone
Throughput and FIFO Sizing: an Application to Latency-Insensitive DesignRapport de recherche, 2009,
inria-00381644J. Boucaron, B. Ferrero, J.-V. Millo, R. De Simone
Statically scheduled Process NetworksRapport de recherche, 08/2007,
inria-00168757J. Boucaron, J.-V. Millo, R. De Simone
Formal Methods for Schedulings of Latency-Insensitive DesignsRapport de recherche, 03/2007,
inria-00137495J. Boucaron, J.-V. Millo, R. De Simone
Latency-Insensitive Design and Central Repetitive SchedulingRapport de recherche, 04/2006,
inria-00071374J. Boucaron, J.-V. Millo, R. De Simone
Another glance at Relay Stations in Latency-Insensitive DesignsRapport de recherche, 04/2005,
inria-00070449J. Boucaron, A. Coadou, B. Ferrero, J.-V. Millo, R. De Simone
Kahn-extended Event GraphsRapport de recherche,
inria-00281559J. Boucaron, A. Coadou, R. De Simone
LID: Retry Relay Station and Fusion ShellRapport de recherche,
inria-00484185R. Boulifa, E. Madelaine
Preuve de propriétés de comportement deprogrammes ProActive05/2002,
inria-00072128B. Bui Xuan, A. Ferreira, A. Jarry
Computing shortest, fastest, and foremost journeys in dynamic networks10/2002,
inria-00071996V. Campos, A. Gyarfas, F. Havet, C. Linhares Sales, F. Maffray
New bounds on the Grundy number of products of graphsRapport de recherche,
inria-00470158V. Campos, F. Havet, R. Sampaio, A. Silva
Backbone colouring: tree backbones with small diameter in planar graphsRapport de recherche,
hal-00758548V. Campos, F. Havet
5-choosability of graphs with 2 crossingsRapport de recherche,
inria-00593426D. Caromel, C. Delbé, L. Henrio
Promised Consistency for Rollback RecoveryRapport de recherche, 05/2006,
inria-00071365D. Caromel, L. Henrio
Asynchronous Sequential Processes03/2003,
inria-00071834S. Caron, F. Giroire, D. Mazauric, J. Monteiro, S. Pérennes
P2P Storage Systems: Data Life Time for Different Placement PoliciesRapport de recherche,
inria-00458190J. Chalopin, V. Chepoi, N. Nisse, Y. Vaxès
Cop and robber games when the robber can hide and rideRapport de recherche,
inria-00448243G. Chang, F. Havet, M. Montassier, A. Raspaud
Steinberg's Conjecture and near-coloringsRapport de recherche,
inria-00605810S. Choplin, J. Galtier, S. Pérennes
Optimal concave costs in the SDH context05/2004,
inria-00070791A. Coadou, R. De Simone
Normal Forms and Equivalence of K-periodically Routed GraphsRapport de recherche,
inria-00485609N. Cohen, D. Coudert, A. Lancin
Exact and approximate algorithms for computing the hyperbolicity of large-scale graphsRapport de recherche,
hal-00735481N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, N. Nisse
Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networksRapport de recherche,
inria-00421140N. Cohen, F. Havet, T. Mueller
Acyclic edge-colouring of planar graphsRapport de recherche,
inria-00367394N. Cohen, F. Havet
Linear and 2-frugal choosability of graphs of small maximum average degreeRapport de recherche,
inria-00459692N. Cohen, F. Havet
Planar graphs with maximum degree Delta\geq 9 are (\Delta+1)-edge-choosable -- short proofRapport de recherche,
inria-00432389D. Coudert, F. Giroire, I. Sau Valls
Circuit visiting 10 ordered vertices in infinite gridsRapport de recherche, 2009,
inria-00378586D. Coudert, J.-S. Sereni
Characterization of graphs and digraphs with small process numberRapport de recherche, 01/2008,
inria-00171083D. Coudert, D. Mazauric
Network Reconfiguration using Cops-and-Robber GamesRapport de recherche, 2008,
inria-00315568D. Coudert, F. Huc, F. Peix, M.-E. Voge
On Minimizing the Average Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs ConstraintsRapport de recherche, 01/10/2007,
inria-00175813D. Coudert, S. Pérennes, H. Rivano, M.-E. Voge
Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation IssuesRapport de recherche, 26/09/2007,
inria-00175143D. Coudert, P. Datta, S. Pérennes, H. Rivano, M.-E. Voge
Complexity and approximability issues of Shared Risk Resource GroupRapport de recherche, 03/2006,
inria-00070167D. Coudert, F. Huc, J.-S. Sereni
Pathwidth of outerplanar graphsRapport de recherche, 01/2006,
inria-00070220D. Coudert, H. Rivano
Lightpath assignment for multifibers wdm optical networks with wavelength translators06/2002,
inria-00072101D. Coudert, A. Ferreira, S. Pérennes
Digraph Isomorphisms and Free Space Optical NetworksRapport de recherche, 11/1999,
inria-00072841D. Coudert, D. Mazauric, N. Nisse
Routing Reconfiguration/Process Number: Networks with Shared Bandwidth.Rapport de recherche,
inria-00350025D. Coudert, F. Huc, D. Mazauric, N. Nisse, J.-S. Sereni
Routing Reconfiguration/Process Number: Coping wih Two Classes of ServicesRapport de recherche,
inria-00331807D. Coudert, F. Huc, D. Mazauric
A distributed algorithm for computing and updating the process number of a forestRapport de recherche,
inria-00288304D. Coudert, N. Nepomuceno, H. Rivano
Wireless Backhaul Networks: Minimizing Energy Consumption by Power-Efficient Radio Links ConfigurationRapport de recherche,
inria-00344344D. Coudert, P. Datta, H. Rivano, M.-E. Voge
Minimum Color Problems and Shared Risk Resource Group in Multilayer NetworksRapport de recherche,
inria-00466486G. D'Angelo, G. Di Stefano, A. Navarra, N. Nisse, K. Suchan
A unified approach for different tasks on rings in robot-based computing systemsRapport de recherche,
hal-00716761O. Dalle
OSA: an Open Component-based Architecture for Discrete-Event SimulationRapport de recherche, 11/2005,
inria-00070258O. Dalle
LoadBuilder: a Tool for Generating and Modeling Workloads in Distributed Workstation Environments11/1996,
inria-00073647O. Dalle, F. Giroire, J. Monteiro, S. Pérennes
Analysis of Failure Correlation in Peer-to-Peer Storage SystemsRapport de recherche,
inria-00346857O. Dalle, F. Giroire, J. Monteiro, S. Pérennes
Analysis of Failure Correlation in Peer-to-Peer Storage SystemsRapport de recherche,
inria-00346857J. Deantoni, F. Mallet
ECL: the Event Constraint Language, an Extension of OCL with EventsRapport de recherche, 19/07/2012,
hal-00721169O. Delmas, M. Montassier, F. Havet, S. Pérennes
Design of fault-tolerant on-board networkRapport de recherche, 03/2006,
inria-00070160O. Delmas, S. Pérennes
Circuit-Switched Gossiping in the 3-Dimensional Torus Networks07/1996,
inria-00073769V. D. Doan, A. Gaikwad, M. Bossy, F. Baude, F. Abergel
A financial engineering benchmark for performance analysis of grid middlewaresRapport Technique, 2009,
inria-00387324V. D. Doan, A. Gaikwad, M. Bossy, F. Baude, I. Stokes-Rees
Parallel Pricing Algorithms for Multi--Dimensional Bermudan/American Options using Monte Carlo methodsRapport de recherche, 2008,
inria-00278514H. Dubois, M.-A. Peraldi-Frati, F. Lakhal
A model for requirements traceability in an heterogeneous model-based design process. Application to automotive embedded systemsRapport de recherche,
inria-00483970N. Eggemann, F. Havet, S. Noble
$k$-$L(2,1)$-Labelling for Planar Graphs is NP-Complete for $k\geq 4$Rapport de recherche,
inria-00360505R. Erman, F. Havet, B. Lidicky, O. Pangrac
5-colouring graphs with 4 crossingsRapport de recherche,
inria-00437726A. Ferreira
Building a Reference Combinatorial Modelfor Dynamic Networks:Initial Results in Evolving Graphs12/2003,
inria-00071542A. Ferreira, L. Viennot
A Note on Models, Algorithms, and Data Structures for Dynamic Communication NetworksRapport de recherche, 03/2002,
inria-00072185A. Ferreira, S. Pérennes, A. Richa, H. Rivano, N. Stier
On the design of Multifiber WDM Networks08/2001,
inria-00072343A. Ferreira, S. Pérennes, H. Rivano
Fractional Coloring of Bounded Degree Trees01/2001,
inria-00072538I. Filali, F. Bongiovanni, F. Huet, F. Baude
RDF Data Indexing and Retrieval: A survey of Peer-to-Peer based solutionsRapport de recherche, 26/11/2010,
inria-00540314M. Flammini, S. Pérennes
Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols01/1999,
inria-00073066B. Florent, A. Kosowski, N. Nisse, I. Rapaport, K. Suchan
Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing powerRapport de recherche,
inria-00627910F. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, N. Nisse
To Satisfy Impatient Web surfers is HardRapport de recherche,
inria-00625703K. Garcés, J. Deantoni, F. Mallet
Transforming CCSL partially-ordered Traces into UML Interaction Diagrams16/12/2011,
hal-00652987L. Gargano, A. Pelc, S. Pérennes, U. Vaccaro
Efficient Communication in Unknown Networks01/1999,
inria-00073069R. Gascon, F. Mallet, J. Deantoni
Logical time and temporal logics: Comparing UML MARTE/CCSL and PSLRapport de recherche, 19/11/2010,
inria-00540738F. Giroire, D. Mazauric, J. Moulierac, B. Onfroy
Minimizing Routing Energy Consumption: from Theoretical to Practical ResultsRapport de recherche, 03/2010,
inria-00464318F. Giroire, J. Monteiro, S. Pérennes
P2P Storage Systems: How Much Locality Can They Tolerate?Rapport de recherche, 2009,
inria-00408078F. Giroire, S. K. Gupta, R. Modrzejewski, J. Monteiro, S. Pérennes
Analysis of the Repair Time in Distributed Storage SystemsRapport de recherche,
inria-00565359C. Gomes, S. Pérennes, H. Rivano
Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless NetworksRapport de recherche, 28/12/2007,
inria-00282200C. Gomez, J. Deantoni, F. Mallet
Multi-View Power Modeling based on UML MARTE and SysMLRapport de recherche,
hal-00688853C. Hamerling, V. Legrand, F. Baude, E. Mathias, C. Ruz, M. Fried, R. Krummenacher, P. Merle, N. Dolet
D1.4.1B SOA4All RuntimeRapport Technique,
hal-00673998N. Hanusse, D. Ilcinkas, A. Kosowski, N. Nisse
How to beat the random walk when you have a clock?Rapport de recherche,
inria-00458808F. Havet, S. Thomassé
Complexity of $(p,1)$-total labellingRapport de recherche, 09/2007,
inria-00173438F. Havet, R. Kang, T. Müller, J.-S. Sereni
Circular ChoosabilityRapport de recherche, 07/2007,
inria-00086981F. Havet, R. Kang, J.-S. Sereni
Improper colouring of unit disk graphsRapport de recherche, 05/2007,
inria-00150464F. Havet, S. Thomassé, A. Yeo
Hoàng-Reed conjecture holds for tournamentsRapport de recherche, 09/2006,
inria-00091366F. Havet
Choosability of the square of planar subcubic graphs with large girthRapport de recherche, 01/2006,
inria-00070223F. Havet
Repartitors, selectors and superselectorsRapport de recherche, 09/2005,
inria-00070327F. Havet, J.-S. Sereni
Improper choosability of graphs and maximum average degree03/2004,
inria-00071425F. Havet
Stable set meeting every longest paths11/2003,
inria-00071575F. Havet
Upper bound for the span of (s,1)-total labelling of graphs05/2003,
inria-00071770F. Havet, M.-L. Yu
(d,1)-total labelling of graphs11/2002,
inria-00071935F. Havet
Design of fault tolerant on board networks with priorities via selectors05/2002,
inria-00072125F. Havet
Robustness of a routing tree for the Push Tree Problem05/2002,
inria-00072124F. Havet
Pancyclic arcs and connectivity in tournaments02/2002,
inria-00072210F. Havet, A. K. Maia, M.-L. Yu
Complexity of greedy edge-colouringRapport de recherche,
hal-00762534F. Havet, A. King, M. Liedloff, I. Todinca
(Circular) backbone colouring: tree backbones in planar graphsRapport de recherche,
hal-00759044F. Havet, A. King
List circular backbone colouringRapport de recherche,
hal-00759527F. Havet, C. Linhares Sales, L. Sampaio
b-coloring of tight graphsRapport de recherche,
inria-00468734F. Havet, J. Van Den Heuvel, C. Mcdiarmid, B. Reed
List colouring squares of planar graphsRapport de recherche,
inria-00303303F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, M. Liedloff
Exact algorithms for $L(2,1)$-labeling of graphsRapport de recherche,
inria-00303330F. Havet, N. Paramaguru, R. Sampathkumar
Detection number of bipartite graphs and cubic graphsRapport de recherche,
hal-00744365F. Havet, S. Jendrol', R. Sotak, E. Skrabulakova
Facial non-repetitive edge-colouring of plane graphsRapport de recherche,
inria-00366589F. Havet, X. Zhu
The game Grundy number of graphsRapport de recherche,
inria-00600738L. Henrio, F. Kammüller, H. Sudhof
ASPfun: A Functional and Distributed Object Calculus Semantics, Type-system, and FormalizationRapport de recherche, 11/2007,
inria-00186963L. Henrio, F. Kammüller
A Formalization of the Theory of Objects in Isabelle/HOLRapport de recherche, 12/2006,
inria-00121816L. Henrio, B. P. Serpette, S. Szentes
Implementation and Complexity of the Lowest Static Reduction12/2003,
inria-00071550L. Henrio, F. Huet, Z. István
A Language for Multi-threaded Active ObjectsRapport de recherche,
hal-00720012L. Henrio, M. Rivera
An algorithm for safely stopping a component systemRapport de recherche,
inria-00239449M.-C. Heydemann, N. Marlin, S. Pérennes
Cayley Graphs with Complete Rotations02/1999,
inria-00073053F. Huc, C. Molle, N. Nisse, S. Pérennes, H. Rivano
Stability of a local greedy distributed routing algorithmRapport de recherche,
inria-00366441T. Issam, S. Pérennes, F. Giroire
A propos de la difficulté du routage égal par plus courts cheminsRapport de recherche,
hal-00763239M. U. Khan, L. Henrio
First Class Futures: a Study of Update StrategiesRapport de recherche, 2008,
inria-00435573R. Klasing, N. Morales, S. Pérennes
On the Complexity of Bandwidth Allocation in Radio Networks with Steady Traffic DemandsRapport de recherche, 12/2004,
inria-00070575A. Kosowski, B. Li, N. Nisse, K. Suchan
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidthhal-00671861R. Krummenacher, I. Toma, C. Hamerling, J.-P. Lorre, F. Baude, V. Legrand, P. Merle, C. Ruz, C. Pedrinaci, D. Liu, T. Pariente Lobo
D1.4.1A SOA4All Reference Architecture SpecificationRapport Technique,
hal-00673752F. Lagarde, F. Mallet, C. André, S. Gérard, F. Terrier
An Automated Process for Designing UML ProfilesRapport de recherche,
inria-00308386F. Lagarde, F. Mallet, C. André, S. Gérard, F. Terrier
Multilevel Modeling Paradigm in Profile DefinitionRapport de recherche,
inria-00276653J.-F. Lalande, M. Syska, Y. Verhoeven
Mascopt - A Network Optimization Library: Graph ManipulationRapport Technique, 04/2004,
inria-00069887S.-Y. Lee, F. Mallet, R. De Simone
Dealing with AADL End-to-end Flow Latency with UML MARTERapport de recherche,
inria-00200834F. Mallet, C. André, F. Lagarde
Un profil UML pour la modélisation multiniveauRapport de recherche, 2008,
inria-00482727F. Mallet, C. André
UML/MARTE CCSL, Signal and Petri netsRapport de recherche,
inria-00283077F. Mallet, L. Yin
Correct Transformation from CCSL to Promela for verificationRapport de recherche,
hal-00667849F. Mallet, M.-A. Peraldi-Frati, C. André
Marte CCSL and East-ADL2 Timing RequirementsRapport de recherche,
inria-00348134J.-C. Maureira, D. Dujovne, O. Dalle
Network Provisioning for High Speed Vehicles Moving along Predictable Routes - Part 1: Spiderman HandoverRapport de recherche,
inria-00369419A. Mehmood Khan, F. Mallet, C. André, R. De Simone
Marte Timing Requirement and Spirit IP-XACTRapport de recherche,
inria-00321953J.-V. Millo, R. De Simone
Periodic scheduling of marked graphs using balanced binary wordsRapport de recherche,
hal-00672606J.-V. Millo, R. De Simone
Refining cellular automata with routing constraintsRapport de recherche,
hal-00725878J. Moulierac, T. K. Phan, N. Thoai, C. Tran
Xcast6 Treemap Islands - A Mixed Model of Application and Network Layer MulticastRapport de recherche,
inria-00637656P. Mussi, G. Siegel
Sequential Simulation in Prosit: Programming Model and Implementation11/1995,
inria-00073978G. Méheut, S. Pérennes, H. Rivano
Evaluation stochastique et simulation des réseaux radioRapport de recherche, 28/09/2006,
inria-00102039N. Nisse, R. Soares
On The Monotonicity of Process NumberRapport de recherche,
hal-00745587V. Papailiopoulou, D. Potop-Butucaru, Y. Sorel, R. De Simone, L. Besnard, J.-P. Talpin
From concurrent multi-clock programs to concurrent multi-threaded implementationsRapport de recherche, 03/2011,
inria-00578585N. Parlavantzas, M. Morel, F. Baude, F. Huet, D. Caromel, V. Getov
Componentising a Scientific Application for the GridRapport Technique,
hal-00694511G. Peretti Pezzi, D. Caromel, E. Vaissié, Y. VIALA, B. Grawitz, F. Bonnadier
High Performance Hydraulic Simulations on the Grid using Java and ProActiveRapport de recherche,
inria-00555866D. Potop-Butucaru, R. De Simone, Y. Sorel
Necessary and Sufficient Conditions for Deterministic DesynchronizationRapport de recherche, 03/2007,
inria-00137885D. Potop-Butucaru, Y. Sorel, R. De Simone
From multi-clock constraints to multi-rate GALS executivesRapport de recherche, 11/2006,
inria-00114032S. Pérennes, I. Sau Valls
Sur la Conjecture des Jeux UniquesRapport de recherche,
inria-00331248C. Ruz, F. Baude, V. Legrand Contes
Towards Grid Monitoring and deployment in Jade, using ProActiveRapport de recherche, 09/2007,
inria-00182554F. Simonot-Lion, L. Thomas, T. Lambolais, A.-M. Déplanche, Y. Trinquet, C. André, M.-A. Péraldi, C. Choukair, M. Bayart
Conception et validation d'architectures distribuées temps réelContrat,
inria-00098849I. Stavridou, A. Ferreira
Multi- Inter- and Trans-disciplinary research promoted by the European Cooperation in Science and Technology (COST): Lessons and experimentsRapport de recherche,
inria-00512712P. Uribe, J.-C. Maureira, O. Dalle
Extending INET Framework for Directional and Asymmetrical Wireless CommunicationsRapport de recherche, 2009,
inria-00448033L. Yin, J. Deantoni, F. Mallet, R. De Simone
Schedulability analysis by exhaustive state space construction: translating CCSL to transition-based Generalized Buchi AutomataRapport de recherche,
hal-00743874
COMMUNICATIONS SANS ACTES
F. Baude, A. Bottaro, J.-M. Brun, A. Chazalet, A. Constancin, D. Donsez, L. Gurgen, P. Lalanda, V. Legrand, V. Lestideau, S. Marié, C. Marin, A. Moreau, V. Olive
Extension de passerelles OSGi pour les domaines de la distribution électrique: Modèles et outilsAtelier de travail OSGi 2006, 2006, Paris, France,
hal-00097266J. Chalopin, V. Chepoi, N. Nisse, Y. Vaxès
Cop and robber games when the robber can hide and ride8th French Combinatorial Conference, 06/2010, Orsay, France,
inria-00482117D. Coudert
Graph searching games for the WDM reconfiguration problem24th European Conference on Operational Research (EURO), 11/07/2010, Lisbon, Portugal,
inria-00482113J. Deantoni, F. Mallet, C. André, F. Thomas
Logical time @ work: the RT-Simex projectSophia Antipolis Formal Approach, 06/04/2011, Sophia, France,
inria-00587151V. Dung Doan, M. Bossy, F. Baude, I. Stokes-Rees
Comparison of parallel distributed American option pricing: Through Continuation Values Classification Versus Optimal Exercise Boundary ComputationSixth IMACS Seminar on Monte Carlo Methods, 18/06/2007, Reading, Royaume-Uni,
hal-00605712J.-F. Le Tallec, J. Deantoni
Toward a TLM to RTL refinement : a formal approach3rd Junior Researcher Workshop on Real-Time Computing (JRWRTC 2009), 26/10/2009, Paris, France,
inria-00494224N. Nisse
Graph Searching and Graph Decompositions24th European Conference on Operational Research (EURO) (2010), 07/2010, Lisbon, Portugal,
inria-00482115
AUTRES
O. Dalle
Should Simulation Products use Software Engineering Techniques or Should they Reuse Products of Software Engineering? -- Part 1SCS Modeling and Simulation Magazine(3) pp.122-132, 01/07/2011,
inria-00638553O. Dalle
Should Simulation Products use Software Engineering Techniques or Should they Reuse Products of Software Engineering? -- Part 2SCS Modeling and Simulation Magazine(4) pp., 01/07/2011,
inria-00638555J. Deantoni, J.-P. Babau
CiberMouse design: a case study for SAIA model reuse The paper describes the approach proposed during the international robotic challenge : cibermouse., 05/12/2005,
inria-00587184J. Deantoni, J.-P. Babau
SAIA : Sensors/Actuators Independent Architecture -- A showcase through the Martian Task Specifications paper associated with the implementation of the martian task international robotic challenge, 05/12/2005,
inria-00587210S. Demathieu, S. Gérard, F. Mallet
Marte, le nouveau standard UML pour les systèmes temps réel embarquésElectronique(189) pp.2-6, 2008,
inria-00371386