Filtrer vos résultats
- 28
- 7
- 20
- 10
- 2
- 2
- 1
- 1
- 30
- 4
- 1
- 1
- 1
- 1
- 3
- 2
- 5
- 9
- 2
- 5
- 3
- 2
- 4
- 34
- 1
- 21
- 14
- 10
- 4
- 3
- 2
- 1
- 1
- 1
- 35
- 15
- 13
- 5
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 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
- 1
- 1
35 résultats
|
|
triés par
|
Validation of spectrum management schemes for PMR networks based on LTE with interference detection2013 IFIP Wireless Days (WD), Nov 2013, Valence, Spain. ⟨10.1109/WD.2013.6686500⟩
Communication dans un congrès
hal-00877250v1
|
|||
|
On the parameterized complexity of separating certain sources from the targetTheoretical Computer Science, 2019, 795, pp.183-193. ⟨10.1016/j.tcs.2019.06.011⟩
Article dans une revue
hal-02343987v1
|
||
|
Fixed-parameter tractability of counting small minimum $(S,T)$-cuts[Research Report] LRI. 2019
Rapport
hal-02176346v1
|
||
The First Approximation Algorithm for the Maximin Latin Hypercube Design ProblemOperations Research, 2018, 66 (1), ⟨10.1287/opre.2017.1665⟩
Article dans une revue
hal-01702467v1
|
|||
Meta-algorithm to Choose a Good On-Line PredictionStabilization, Safety, and Security of Distributed Systems International Symposium (SSS), Nov 2016, Lyon, France
Communication dans un congrès
hal-01566270v1
|
|||
|
Completion of partial Latin Hypercube Designs: NP-completeness and inapproximabilityTheoretical Computer Science, 2018, 715, pp.1 - 20. ⟨10.1016/j.tcs.2018.01.014⟩
Article dans une revue
hal-01702464v1
|
||
Fixed-parameter tractability of counting small minimum (S,T)-cuts45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Jun 2019, Vall de Núria, Spain
Communication dans un congrès
hal-02105265v1
|
|||
|
New lower bounds for Schur and weak Schur numbers2022
Pré-publication, Document de travail
hal-04377719v1
|
||
|
Allocation équitable de ressources dans les réseaux ad hoc OFDMACFIP 2011 - Colloque Francophone sur l Ingénierie des Protocoles, UTC, May 2011, Sainte Maxime, France
Communication dans un congrès
inria-00587155v1
|
||
Restricting the search space to boost Quantum Annealing performanceIEEE CEC, Jul 2016, Vancouver, Canada
Communication dans un congrès
hal-01295746v1
|
|||
Multiple Canadians on the road: minimizing the distance competitive ratioJournal of Combinatorial Optimization, 2019, 38 (4), pp.1086-1100. ⟨10.1007/s10878-019-00438-6⟩
Article dans une revue
hal-02343983v1
|
|||
The First Approximation Algorithm for the Maximin Latin Hypercube Design ProblemOperations Research, 2018, 66 (1), pp.253-266. ⟨10.1287/opre.2017.1665⟩
Article dans une revue
hal-04379112v1
|
|||
Improvement of Cell Edge Performance by Coupling RB Allocation with Beamforming2014 IEEE International Conference on Communication Systems (ICCS), Nov 2014, Macau, Singapore. 6p., ⟨10.1109/iccs.2014.7024820⟩
Communication dans un congrès
hal-01061244v1
|
|||
|
Micro-Doppler Signal Representation for Drone Classification by Deep Learning2020 28th European Signal Processing Conference (EUSIPCO), Jan 2021, Amsterdam, France. pp.1561-1565, ⟨10.23919/Eusipco47968.2020.9287525⟩
Communication dans un congrès
hal-03602645v1
|
||
Frequency Reuse with Incomplete Information in a Novel Generation of PMR Networks2014 7th IFIP Wireless and Mobile Networking Conference (WMNC), May 2014, Vilamoura, Portugal. 8p., ⟨10.1109/WMNC.2014.6878870⟩
Communication dans un congrès
hal-00959901v1
|
|||
An Author Network to Classify Open Online Discussions International Symposium on Open Collaboration (OpenSym), Aug 2017, Galway, Ireland
Communication dans un congrès
hal-01577208v1
|
|||
Load Prediction for Energy-Aware Scheduling for Cloud Computing PlatformsThe 37th IEEE International Conference on Distributed Computing Systems (ICDCS 2017), Jun 2017, Atlanta, United States
Communication dans un congrès
hal-01566244v1
|
|||
|
Minimization of the receiver cost in an all-optical ring with a limited number of wavelengths2011
Rapport
hal-00611017v1
|
||
|
Optimal receiver cost and wavelength number minimization in all-optical ring networks2011
Pré-publication, Document de travail
hal-00561834v1
|
||
The Consent of the Crowd Detected in an Open ForumOpenSym, Aug 2018, Paris, France. pp.1-9, ⟨10.1145/3233391.3233538⟩
Communication dans un congrès
hal-01811801v1
|
|||
|
A Pareto-optimal Approach for Resource Allocation on the LTE downlinkIEEE International Conference on Communications (ICC 2016), May 2016, Kuala Lumpur, Malaysia. ⟨10.1109/icc.2016.7511015⟩
Communication dans un congrès
hal-01292786v1
|
||
|
A packing problem approach to energy-aware load distribution in CloudsSustainable Computing : Informatics and Systems, 2016, 9, pp.20--32. ⟨10.1016/j.suscom.2015.08.001⟩
Article dans une revue
hal-01289225v1
|
||
The Competitiveness of Randomized Strategies for Canadians via Systems of Linear InequalitiesInternational Symposium on Computer and Information Sciences, Sep 2018, Poznań, Poland. pp.96-103, ⟨10.1007/978-3-030-00840-6_11⟩
Communication dans un congrès
hal-04379165v1
|
|||
Binary classification vs anomaly detection on imbalanced tabular medical datasetsWorld Congress in Computer Science, Computer Engineering, & Applied Computing, Jul 2023, Las Vegas (Nevada ), United States
Communication dans un congrès
hal-04378926v1
|
|||
|
Resource Allocation in Ad Hoc Networks with Two-Hop Interference ResolutionIEEE Global Telecommunications Conference (Globecom'11), Dec 2011, Houston, United States. pp.1-6
Communication dans un congrès
hal-00730650v1
|
||
Bandits Help Simulated Annealing to Complete a Maximin Latin Hypercube DesignInternational Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR), Jun 2018, Delft, Netherlands. pp.280-288, ⟨10.1007/978-3-319-93031-2_20⟩
Communication dans un congrès
hal-01796315v1
|
|||
|
Fixed-Parameter Tractability of Counting Small Minimum (S, T)-CutsGraph-Theoretic Concepts in Computer Science, 11789, Springer International Publishing, pp.79-92, 2019, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-30786-8_7⟩
Chapitre d'ouvrage
hal-02343993v1
|
||
On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-CutsSIAM Journal on Discrete Mathematics, 2023, 37 (2), pp.964-996. ⟨10.1137/21M1398203⟩
Article dans une revue
hal-04408090v1
|
|||
A Packing Problem Approach to Lightpath Assignment in an Optical RingThe Computer Journal, 2014, 57 (8), pp.1155-1166. ⟨10.1093/comjnl/bxt050⟩
Article dans une revue
hal-00831550v1
|
|||
|
Spatial Frequency Reuse in a Novel Generation of PMR Networks2013 IEEE Wireless Communications and Networking Conference (WCNC), Apr 2013, Shanghai, China. pp.1428--1433, ⟨10.1109/WCNC.2013.6554770⟩
Communication dans un congrès
hal-00817794v1
|
- 1
- 2