Filtrer vos résultats
- 60
- 25
- 43
- 37
- 2
- 2
- 1
- 78
- 35
- 1
- 5
- 2
- 2
- 5
- 10
- 3
- 7
- 5
- 2
- 10
- 7
- 6
- 9
- 5
- 6
- 81
- 4
- 85
- 12
- 10
- 9
- 9
- 7
- 4
- 4
- 4
- 4
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 85
- 18
- 11
- 10
- 10
- 7
- 7
- 7
- 7
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
85 résultats
A framework for joint admission control, resource allocation and pricing for network slicing in 5GGLOBECOM 2021: IEEE Global Communications Conference, Dec 2021, Madrid, Spain. pp.1-6, ⟨10.1109/GLOBECOM46510.2021.9685847⟩
Communication dans un congrès
hal-03546908v1
|
|||
|
|
Byzantine-resistant reputation-based trust managementCOLLABORATECOM 2013 : 9th IEEE International Conference on Collaborative Computing : Networking, Applications and Worksharing, Oct 2013, Austin, United States. pp.269 - 278, ⟨10.4108/icst.collaboratecom.2013.254048⟩
Communication dans un congrès
hal-01261638v1
|
||
Characterization of Ping-Pong Optimized Pulse Shaping-OFDM (POPS-OFDM) for 5G systemsVTC Spring 2015 : 81st Vehicular Technology Conference, May 2015, Glascow, United Kingdom. pp.1 - 6, ⟨10.1109/VTCSpring.2015.7145741⟩
Communication dans un congrès
hal-01265526v1
|
|||
|
|
Fractional routing using pairs of failure-disjoint pathsDiscrete Applied Mathematics, 2014, 164 (1), pp.47 - 60. ⟨10.1016/j.dam.2011.12.019⟩
Article dans une revue
hal-01263061v1
|
||
Algorithms and formulations for the minimum cut separator problemElectronic Notes in Discrete Mathematics, 2010, 36 (1), pp.977-983. ⟨10.1016/j.endm.2010.05.124⟩
Article dans une revue
istex
hal-00528560v1
|
|||
|
|
Optimal routing configuration clustering through dynamic programmingALGOTEL 2019 : 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2019, Saint Laurent de la Cabrerisse, France
Communication dans un congrès
hal-02125608v1
|
||
Fiber cable network design in tree networksEuropean Journal of Operational Research, 2018, 269 (3), pp.1086 - 1106. ⟨10.1016/j.ejor.2018.02.034⟩
Article dans une revue
hal-01791553v1
|
|||
|
|
New bounds for subset selection from conic relaxationsEuropean Journal of Operational Research, 2022, 298 (2), pp.425-438. ⟨10.1016/j.ejor.2021.07.011⟩
Article dans une revue
hal-03557321v1
|
||
|
|
Beamforming-based broadcast scheme for multihop wireless networks with transmission range adjustmentWONS 2013 : The 10th Annual Conference on Wireless On-Demand Network Systems and Services, Mar 2013, Banff, Canada. pp.107 - 109, ⟨10.1109/WONS.2013.6578330⟩
Communication dans un congrès
hal-00865275v1
|
||
On unicyclic graphs with a lower bounded girthECCO XXI : European Chapter on Combinatorial Optimization, May 2008, Dubrovnik, Croatia
Communication dans un congrès
hal-01378749v1
|
|||
Designing Steiner networks with unicyclic connected components : an easy problemSIAM Journal on Discrete Mathematics, 2010, 24 (4), pp.1541 - 1557. ⟨10.1137/090759033⟩
Article dans une revue
hal-01308332v1
|
|||
A Zero-sum Game for Opinion Dynamics in a Social Network with Competing Camps13th European Meeting on Game Theory (SING13), Jul 2017, Paris, France
Poster de conférence
hal-01716712v1
|
|||
|
|
A Framework for Optimal Investment Strategies for Competing Camps in a Social NetworkPGMO Days 2017 – Gaspard Monge Program For Optimization, Operations Research and their Interactions with Data Sciences, Nov 2017, Paris, France. pp.1, 2017
Poster de conférence
hal-01712293v1
|
||
On the minimum cut separator problemNetworks, 2012, 59 (1), pp.30-36. ⟨10.1002/net.20478⟩
Article dans une revue
istex
hal-00679174v1
|
|||
Robust routing in communication networksProgress in combinatorial optimization, Iste; Wiley, pp.353 - 390, 2011, 978-1-848-21206-0
Chapitre d'ouvrage
hal-01279133v1
|
|||
|
|
From graph orientation to the unweighted maximum cutCOCOON 2016 : 22nd International Conference on Computing and Combinatorics, Aug 2016, Ho Chi Minh Ville, Vietnam. pp.370-384, ⟨10.1007/978-3-319-42634-1_30⟩
Communication dans un congrès
hal-01497887v1
|
||
|
|
A full description of polytopes related to the index of the lowest nonzero row of an assignment matrixISCO 2016 : 4th International Symposium on Combinatorial Optimization, May 2016, Vietri Sul Mare, Italy. pp.13-25, ⟨10.1007/978-3-319-45587-7_2⟩
Communication dans un congrès
hal-01497880v1
|
||
Cables network design optimization for the Fiber To The HomeDRCN 2016 : 12th International Conference on the Design of Reliable Communication Networks , Mar 2016, Paris, France. pp.87 - 94, ⟨10.1109/DRCN.2016.7470839⟩
Communication dans un congrès
hal-01450509v1
|
|||
Optimal mapping of cloud virtual machinesElectronic Notes in Discrete Mathematics, 2016, 52, pp.93 - 100. ⟨10.1016/j.endm.2016.03.013⟩
Article dans une revue
hal-01453255v1
|
|||
|
|
Enhancing Broadcast Vehicular Communications Using Beamforming TechniqueInternational Workshop on Vehicular Communications and Networking (VECON), 2012, pp.565
Article dans une revue
hal-00761075v1
|
||
|
|
A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machinesEuropean Journal of Operational Research, 2019, 276 (1), pp.28-39. ⟨10.1016/j.ejor.2018.12.037⟩
Article dans une revue
hal-02440722v1
|
||
Spectral bounds for the maximum cut problemNetworks, 2008, 52 (1), pp.8 - 13. ⟨10.1002/net.20220⟩
Article dans une revue
istex
hal-01326524v1
|
|||
Régularisation TV pour le consensus robuste dans les systèmes distribuésXXIVème Colloque Gretsi, Sep 2013, Brest, France
Communication dans un congrès
hal-00867213v1
|
|||
Efficient algorithms for the maximum concurrent flow problemNetworks, 2015, 65 (1), pp.56 - 67. ⟨10.1002/net.21572⟩
Article dans une revue
istex
hal-01265440v1
|
|||
|
|
Optimal multiphase investment strategies for influencing opinions in a social networkAAMAS 2018: 17th international conference on Autonomous Agents and Multiagent Systems, Jul 2018, Stockholm, Sweden. pp.1927-1929, ⟨10.5555/3237383.3238026⟩
Communication dans un congrès
hal-01716062v2
|
||
Cache location in tree networks : preliminary resultsINOC '11 : International Network Optimization Conference, Jun 2011, Hamburg, Germany. pp.517-522, ⟨10.1007/978-3-642-21527-8_56⟩
Communication dans un congrès
istex
hal-00840387v1
|
|||
Steiner Networks with unicyclic connected componentsElectronic Notes in Discrete Mathematics, 2010, 36 (1), pp.969-976. ⟨10.1016/j.endm.2010.05.123⟩
Article dans une revue
istex
hal-00528042v1
|
|||
A note on the problem of r disjoint (s,t)-cuts and some related issuesOperations Research Letters, 2018, 46, pp.335 - 338. ⟨10.1016/j.orl.2018.03.003⟩
Article dans une revue
hal-01783782v1
|
|||
A gradient-based randomised heuristic for the maximum cut problemInternational Journal of Mathematics in Operational Research, 2012, 4 (3), pp.276-293. ⟨10.1504/12.46688⟩
Article dans une revue
hal-00702709v1
|
|||
A geometric characterization of "optimality-equivalent" relaxationsJournal of Global Optimization, 2008, 42 (4), pp.533 - 547. ⟨10.1007/s10898-007-9275-5⟩
Article dans une revue
istex
hal-01372395v1
|