|
MASCOTTE no longer exists => visit the new project-team
BACK TO MASCOTTE PUBLICATION INDEX
Publications of year 2007
-
G. Chelius and D. Coudert, editors.
Neuvièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'07),
volume 9,
Ile d'Oléron, France,
May 2007.
CNRS, LaBRI, Université Bordeaux I.
[WWW
] [bibtex-entry]
-
O. Amini.
Algorithmique des décompositions de graphes Applications aux réseaux de télécommunications.
PhD thesis,
École doctorale STIC, Université de Nice-Sophia Antipolis,
November 28 2007.
[Abstract] [bibtex-entry]
-
F. Havet.
Graph colouring and applications.
Habilitation à Diriger des Recherches,
Université de Nice-Sophia Antipolis,
December 12 2007.
[WWW
] [bibtex-entry]
-
L. Hogie.
Mobile Ad Hoc Networks: Modelling, Simulation and Broadcast-based Applications.
PhD thesis,
University of Le Havre, University of Luxembourg,
April 2007.
[Abstract] [bibtex-entry]
-
L. Liquori.
Peter, le langage qui n'existe pas... (Peter, the language that does not exists...).
Habilitation à Diriger des Recherches,
Institut National Polytechnique de Lorraine (INPL),
6 Juillet 2007.
[PDF
] [bibtex-entry]
-
N. Morales.
Algorithmique des réseaux de communication radio modélisés par des graphes.
PhD thesis,
École doctorale STIC, Université de Nice-Sophia Antipolis,
26 Janvier 2007.
[PDF
] [bibtex-entry]
-
L. Addario-Berry,
K. Dalal,
C. McDiarmid,
B. Reed,
and A. Thomason.
Vertex Colouring Edge Weightings.
Combinatorica,
27:1-12,
2007.
[bibtex-entry]
-
L. Addario-Berry,
F. Havet,
and S. Thomassé.
Paths with two blocks in $n$-chromatic digraphs.
Journal of Combinatorial Theory Ser. B,
97:620--626,
2007.
[PDF
] [bibtex-entry]
-
E. Alba,
B. Dorronsoro,
F. Luna,
A.J. Nebro,
P. Bouvry,
and L. Hogie.
A cellular multi-objective genetic algorithm for optimal broadcasting strategy in metropolitan MANETs.
Computer Communications,
30(4):685--697,
August 2007.
[WWW
] [Abstract] [bibtex-entry]
-
R. Bayon,
N. Lygeros,
and J.-S. Sereni.
Orders with ten elements are circle orders.
Applied Mathematics E-Notes,
7:16--22,
2007.
[WWW
] [PDF
] [bibtex-entry]
-
J-C. Bermond,
L. Braud,
and D. Coudert.
Traffic Grooming on the Path.
Theoretical Computer Science,
384(2-3):139-151,
October 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
A. Ferreira,
S. Pérennes,
and J. Peters.
Neighbourhood Broadcasting in Hypercubes.
SIAM Journal on Discrete Mathematics,
21(4):823-843,
2007.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond and M.-L. Yu.
Vertex disjoint routings of cycles over tori.
Networks,
49(3):217-225,
2007.
[PDF
] [bibtex-entry]
-
E. Birmelé,
J. A. Bondy,
and B. Reed.
The Erdos-Posa property for long circuits.
Combinatorica,
27:135-145,
2007.
[bibtex-entry]
-
P. Charbit,
S. Thomassé,
and A. Yeo.
The minimum feedback arc set problem is NP-hard for tournament.
Combinatorics, Probability and Computing,
16:1--4,
2007.
[bibtex-entry]
-
A. Ciaffaglione,
L. Liquori,
and M. Miculan.
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts.
JAR, Journal of Automated Reasoning,
39:1--47,
2007.
[PDF
] [bibtex-entry]
-
D. Coudert,
P. Datta,
S. Perennes,
H. Rivano,
and M-E. Voge.
Shared Risk Resource Group: Complexity and Approximability issues.
Parallel Processing Letters,
17(2):169-184,
June 2007.
[PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
and J.-S. Sereni.
Pathwidth of outerplanar graphs.
Journal of Graph Theory,
55(1):27-41,
May 2007.
[PDF
] [Abstract] [bibtex-entry]
-
S. Fiorini,
N. Hardy,
B. Reed,
and A. Vetta.
Approximate min-max relations for odd cycles in planar graphs.
Mathematical Programming Ser. B,
110(1):71--91,
2007.
[bibtex-entry]
-
M. Flammini,
R. Klasing,
A. Navarra,
and S. Pérennes.
Improved approximation results for the Minimum Energy Broadcasting problem.
Algorithmica,
49(4):318-336,
2007.
[WWW
] [Abstract] [bibtex-entry]
-
N. Fountoulakis and B. Reed.
Faster Mixing and Small Bottlenecks.
Probability Theory and Related Fields,
137:475-486,
2007.
[bibtex-entry]
-
J. Galtier and A. Laugier.
Flow on data network and a positive semidefinite representable delay function.
Journal of Interconnection Networks,
8(1):29--43,
March 2007.
[PDF
] [Abstract] [bibtex-entry]
-
L. Grigori,
M. Cosnard,
and E. G. Ng.
On the row merge for sparse LU factorization with partial pivoting.
BIT Numerical Mathematics,
47(1):45--76,
March 2007.
[PDF
] [Abstract] [bibtex-entry]
-
F. Honsell,
M. Lenisa,
and L. Liquori.
A Framework for Defining Logical Frameworks.
Electronic Notes in Theoretical Computer Science,
172:399 - 436,
2007.
Note: Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Liquori and S. Ronchi Della Rocca.
Intersection Typed System à la Church.
IC, Journal of Information and Computation,
205(9):1371--1386,
September 2007.
[WWW
] [PDF
] [bibtex-entry]
-
O. Amini,
S. Pérennes,
and I. Sau.
Hardness and Approximation of Traffic Grooming.
In The 18th International Symposium on Algorithms and Computation (ISAAC 2007),
volume 4835 of Lecture Notes in Computer Science,
Sendai, Japan,
pages 561-573,
December 2007.
Springer-Verlag.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
S. Pérennes,
and I. Sau.
Hardness of Approximating the Traffic Grooming.
In Neuvièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'07),
Ile d'Oléron, France,
pages 45-48,
May 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini and B. Reed.
List Colouring Constants of Triangle Free Graphs.
In IV Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 07),
Puerto Varas, Chile,
pages 6p,
November 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Araujo and C. Linhares Sales.
Teorema de Hajós para Coloração Ponderada.
In XXXIX Simpósio Brasileiro de Pesquisa Operacional,
Fortaleza, Brazil,
pages 5p,
August 2007.
[PDF
] [Abstract] [bibtex-entry]
-
N. Ben Ali,
J. Moulierac,
B. Belghith,
and M. Molnár.
mQMA: multi-constrained QoS Multicast Aggregation.
In IEEE Global Telecommunications Conference (IEEE GLOBECOM 2007),
Washington DC, USA,
pages 5p,
November 2007.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond and M. Cosnard.
Minimum number of wavelengths equals load in a DAG without internal cycle.
In Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International,
Long Beach, CA, U.S.A.,
pages 1-10,
March 2007.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
F. Giroire,
and S. Pérennes.
Design of Minimal Fault Tolerant On-Board Networks : Practical constructions.
In 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO 07),
volume 4474 of Lecture Notes in Computer Sciences,
Castiglioncello, Italy,
pages 261-273,
June 2007.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
F. Havet,
F. Huc,
and C. Linhares-Sales.
Allocation de fréquences et coloration impropre des graphes hexagonaux pondérés.
In Neuvièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'07),
Ile d'Oléron, France,
pages 53-56,
May 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Bessy,
N. Lichiardopol,
and J.-S. Sereni.
Two proofs of Bermond-Thomassen conjecture for regular tournaments.
In Proceedings of the sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications,
volume 28 of Electronic Notes in Discrete Mathematics,
pages 47--53,
2007.
Elsevier.
[WWW
] [PDF
] [bibtex-entry]
-
E. Birmele,
J. A. Bondy,
and B. Reed.
Brambles, Prisms and Grids.
In Proceedings of a Conference in Memory of Claude Berge, Graph Theory in Paris,
Basel,
pages 37-44,
2007.
Birkhauser.
[bibtex-entry]
-
R. Chand,
L. Liquori,
and M. Cosnard.
Improving Resource Discovery in the Arigatoni Overlay Network.
In 20th International Conference on Architecture of Computing Systems (ARCS 2007),
volume 4415 of Lecture Notes in Computer Science,
Zurich, Switzerland,
pages 98--111,
2007.
Springer.
[PDF
] [bibtex-entry]
-
A. Chattopadhyay and B. Reed.
Properly 2-Colouring Linear Hypergraphs.
In 11th Intl. Workshop on Randomization and Computation (RANDOM 2007),
volume 4627 of Lecture Notes in Computer Science,
Princeton University, NJ, USA,
pages 395-408,
2007.
Springer.
[PDF
] [bibtex-entry]
-
M. Cosnard,
L. Liquori,
and R. Chand.
Virtual Organizations in Arigatoni.
In DCM, International Workshop on Developpment in Computational Models,
volume 171 of Electronique Notes in Theoretical Computer Science,
pages 55--75,
2007.
[WWW
] [PDF
] [bibtex-entry]
-
O. Dalle.
Component-based Discrete Event Simulation Using the Fractal Component Model.
In AI, Simulation and Planning in High Autonomy Systems (AIS)-Conceptual Modeling and Simulation (CMS) Joint Conference,
Buenos Aires, AR,
pages 213--218,
February 2007.
[PDF
] [bibtex-entry]
-
O. Dalle.
The OSA Project: an Example of Component Based Software Engineering Techniques Applied to Simulation.
In Proc. of the Summer Computer Simulation Conference (SCSC'07),
San Diego, CA, USA,
pages 1155--1162,
July 2007.
Note: Invited paper.
[PDF
] [bibtex-entry]
-
O. Dalle and C. Mrabet.
An Instrumentation Framework for component-based simulations based on the Separation of Concerns paradigm.
In Proc. of 6th EUROSIM Congress (EUROSIM'2007),
Ljubljana, Slovenia,
pages 10p,
September 2007.
[PDF
] [bibtex-entry]
-
O. Dalle and G. Wainer.
An Open Issue on Applying Sharing Modeling Patterns in DEVS.
In Proc. of the DEVS Workshop of the Summer Computer Simulation Conference (SCSC'07),
San Diego, CA,
July 2007.
Note: Short paper.
[PDF
] [bibtex-entry]
-
G. Danoy,
P. Bouvry,
and L. Hogie.
Coevolutionary Genetic Algorithms for Ad Hoc Injection Networks Design Optimization.
In Proceedings of the IEEE Congress on Evolutionary Computation - CEC,
Singapore,
pages 8p,
September 2007.
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
A. Ferreira,
A. Goldman,
and J. Monteiro.
On the evaluation of shortest journeys in dynamic networks.
In Proceedings of the 6th IEEE International Symposium on Network Computing and Applications,
Cambridge, MA, USA,
pages 3--10,
July 2007.
Note: Invited Paper.
[PDF
] [Abstract] [bibtex-entry]
-
A. Ferreira,
A. Goldman,
and J. Monteiro.
Using Evolving Graphs Foremost Journey to Evaluate Ad-Hoc Routing Protocols.
In Proceedings of 25th Brazilian Symposium on Computer Networks (SBRC'07),
Belem, Brazil,
pages 17--30,
June 2007.
[PDF
] [Abstract] [bibtex-entry]
-
E. Fusy and F. Giroire.
Estimating the number of active flows in a data stream over a sliding window.
In David Appelgate, editor,
Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithmics and Combinatorics,
pages 223-231,
2007.
SIAM Press.
Note: Proceedings of the New Orleans Conference.
[PDF
] [Abstract] [bibtex-entry]
-
J. Galtier.
Analysis and optimization of MAC with constant size congestion window for WLAN.
In The Second International Conference on Systems and Networks Communications (ICSNC'07),
Cap Esterel, French Riviera, France,
pages 6p,
August 2007.
[PDF
] [bibtex-entry]
-
C. Gomes and G. Huiban.
Multiobjective Analysis in Wireless Mesh Networks.
In International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS),
pages 103--108,
October 2007.
Bogazici University, Istanbul, Turkey,
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Gomes,
C. Molle,
P. Reyes,
and H. Rivano.
Models for Optimal Wireless Mesh Network Design.
In The 22nd European Conference on Operational Research (EURO XXII),
Prague,
pages 1p,
July 2007.
[Abstract] [bibtex-entry]
-
C. Gomes,
C. Molle,
P. Reyes,
and H. Rivano.
Placement Optimal de points d'accès dans les réseaux radio maillés.
In Neuvièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'07),
Ile d'Oléron, France,
pages 117-120,
May 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
J. van den Heuvel,
C. McDiarmid,
and B. Reed.
List colouring squares of planar graphs.
In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2007),
volume 29 of Electronic Notes in Discrete Mathematics,
Sevilla, Spain,
pages 515-519,
September 2007.
[PDF
] [bibtex-entry]
-
G. Huiban and P. Datta.
Multi-Metrics Reconfiguration in Core WDM Networks.
In International Workshop on the Design of Reliable Communication Networks (DRCN),
La Rochelle, France,
pages 8p,
October 2007.
SEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Ilcinkas,
N. Nisse,
and D. Soguet.
The Cost of Monotonicity in Distributed Graph Searching.
In OPODIS,
volume 4878 of Lecture Notes in Computer Science,
Guadeloupe, France,
pages 415-428,
December 2007.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
K. Kawarabayashi and B. Reed.
Computing crossing number in linear time..
In 39th ACM Symposium on Theory of Computing (STOC 2007),
San Diego, CA, USA,
pages 382-390,
June 2007.
[bibtex-entry]
-
A. King and B. Reed.
Asymptotics of the chromatic number for quasi-line graphs.
In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2007),
volume 29 of Electronic Notes in Discrete Mathematics,
Sevilla, Spain,
pages 327-331,
September 2007.
[bibtex-entry]
-
L. Liquori and M. Cosnard.
Logical Networks: Towards Foundations for Programmable Overlay Networks and Overlay Computing Systems.
In 3rd Symposium on Trustworthy Global Computing (TGC 2007),
volume 4912 of Lecture Notes in Computer Science,
Sophia Antipolis, France,
pages 90-107,
November 2007.
Springer.
[PDF
] [bibtex-entry]
-
L. Liquori and M. Cosnard.
Weaving Arigatoni with a Graph Topology.
In International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2007),
Papeete, French Polynesia,
pages 8p,
November 2007.
IEEE Computer Society Press.
[PDF
] [bibtex-entry]
-
F. Mazoit and N. Nisse.
Monotonicity of Non-deterministic Graph Searching.
In Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG),
volume 4769 of Lecture Notes in Computer Science,
Dornburg, Germany,
pages 33-44,
June 2007.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nepomuceno,
P. R. Pinheiro,
and A. L. V. Coelho.
Combining Metaheuristics and Integer Linear Programming: A Hybrid Methodology Applied to the Container Loading Problem.
In XX Concurso de Teses e Dissertações (CTD),
Rio de Janeiro, Brazil,
pages 2028-2032,
2007.
[PDF
] [bibtex-entry]
-
N. Nepomuceno,
P. R. Pinheiro,
and A. L. V. Coelho.
Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms.
In 7th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP),
Valencia, Spain,
pages 154-165,
2007.
[WWW
] [PDF
] [bibtex-entry]
-
N. Nisse and D. Soguet.
Graph Searching with Advice.
In Proceedings of the 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO),
volume 4474 of Lecture Notes in Computer Science,
Castiglioncello, Italy,
pages 51-65,
June 2007.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nisse and D. Soguet.
Stratégies d'encerclement avec information.
In 9èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 49-52,
2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
I. Sau and J. Zerovnik.
Optimal Permutation Routing on Mesh Networks.
In Proc. of International Network Optimization Conference (INOC 2007),
Spa, Belgium,
pages 6p,
April 2007.
[PDF
] [Abstract] [bibtex-entry]
-
A. da Silva,
A. da Silva,
and C. Linhares-Sales.
Largura em Árvore de Grafos Planares Livres de Ciclos Pares Induzidos.
In XXXIX Congresso da Sociedade Brasileira de Pesquisa Operacional (SBPO 2007),
Fortaleza, Brazil,
August 2007.
[WWW
] [bibtex-entry]
-
O. Amini,
D. Coudert,
and N. Nisse.
Some Results on Non-deterministic Graph Searching in Trees.
Research Report INRIA-00174965,
INRIA,
September 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
L. Esperet,
and J. van den Heuvel.
Frugal Colouring of Graphs.
Research Report 6178,
INRIA,
May 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Havet,
F. Huc,
and S. Thomassé.
WDM and Directed Star Arboricity.
Research Report 6179,
INRIA,
January 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Mazoit,
N. Nisse,
and S. Thomassé.
Submodular partition functions.
Technical report RR-1427-07,
LABRI, Univ. Bordeaux,
April 2007.
Note: Submitted in SIAM J. discrete Maths. [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
S. Pérennes,
and I. Sau.
Hardness and Approximation of Traffic Grooming.
Research Report 6236,
INRIA,
June 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
I. Sau,
and S. Saurabh.
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem.
Research Report 6237,
INRIA,
June 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
I. Caragiannis,
D. Coudert,
C. Gomes,
I. Guerin-Lassous,
G. Huiban,
C. Molle,
and I. Sau.
Algorithmic solutions for critical resource sharing: second year.
Technical report Deliverable 2.2.2,
IST FET AEOLUS, Integrated Project IST-015964,
2007.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
and B. Leveque.
Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring.
Technical report inria-00175795,
hal,
October 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
V. Papadopoulou,
and E. Pitoura.
Subproject2: Resource Management Report on the activities of the second year.
Technical report Deliverable 2.O.2,
IST FET AEOLUS, Integrated Project IST-015964,
2007.
[PDF
] [bibtex-entry]
-
D. Coudert,
F. Huc,
F. Peix,
and M-E. Voge.
On Minimizing the Average Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints.
Technical report inria-00175813,
hal,
October 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
S. Perennes,
H. Rivano,
and M-E. Voge.
Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues.
Technical report inria-00175143,
HAL,
September 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert and J-S. Sereni.
Characterization of graphs and digraphs with small process number.
Research Report 6285,
INRIA,
September 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Galtier.
Tournament MAC with constant size congestion window for WLAN.
Technical report RR-6396,
INRIA,
December 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Giroire,
J. Chendrashekar,
G. Iannaccone,
T. Karagiannis,
K. Papagiannaki,
E. Schooler,
and N. Taft.
Inside the Forbidden City: A look at End-Host Traffic inside a Modern Enterprise.
Technical Report,
Intel Research,
2007.
[PDF
] [bibtex-entry]
-
F. Giroire,
J. Chendrashekar,
N. Taft,
G. Iannaccone,
T. Karagiannis,
K. Papagiannaki,
and E. Schooler.
The Case For Personalizing End-Host Detectors..
Technical Report,
Intel Research,
2007.
[PDF
] [bibtex-entry]
-
C. Gomes and H. Rivano.
Fair Joint Routing and Scheduling Problem in Wireless Mesh Networks.
Research Report 6198,
INRIA,
May 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
R. Kang,
and J.-S. Sereni.
Improper colouring of unit disk graphs.
Research Report 6206,
INRIA,
May 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet and S. Thomasse.
Complexity of $(p,1)$-total labelling.
Research Report 6305,
INRIA,
September 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
R. Klasing,
Z. Lotker,
A. Navarra,
and S. Pérennes.
From Balls and Bins to Points and Vertices.
Technical Report RR-1437-07,
LaBRI,
October 2007.
[bibtex-entry]
-
L. Liquori,
D. Borsetti,
C. Casetti,
and C. Chiasserini.
Overlay Networks for Vehicular Networks.
Research Report,
Politecnico di Torino,
2007.
[bibtex-entry]
-
C. Molle,
F. Peix,
and H. Rivano.
Cross-Layer Design for Wireless Mesh Networks Using Column Generation.
Technical report 6448,
INRIA,
December 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
P. Nain,
C. Casetti,
and L. Liquori.
A Stochastic Model of an Arigatoni Overlay Computer.
Research Report to be given,
Politecnico di Torino,
2007.
[bibtex-entry]
-
S. Teigen.
Distributing OSA Simulations using FractalRMI.
Technical Report,
INRIA,
2007.
Note: Unpublished, internal document.[bibtex-entry]
-
C. Gomes and G. Huiban.
Multiobjective Analysis in Wireless Mesh Networks using a Column Generation Approach.
Ecole ResCom 2007 Reseaux Autonomes et Internet du Futur,
2007.
Note: Poster.
[PDF
] [bibtex-entry]
BACK TO MASCOTTE PUBLICATION INDEX
Last modified: Thu Oct 10 14:10:00 2013
This document was translated from BibTEX by
bibtex2html
|
