Filtrer vos résultats
- 32
- 31
- 1
- 41
- 14
- 8
- 1
- 64
- 4
- 1
- 4
- 4
- 4
- 5
- 7
- 7
- 3
- 5
- 6
- 5
- 5
- 1
- 4
- 1
- 2
- 62
- 2
- 32
- 24
- 23
- 18
- 14
- 10
- 9
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 64
- 22
- 21
- 12
- 10
- 8
- 7
- 7
- 6
- 6
- 6
- 6
- 5
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 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
- 1
- 1
- 1
- 1
64 résultats
On the Tardiness Minimization on Single Machine2021 IEEE International Conference on Networking, Sensing and Control (ICNSC), Dec 2021, Xiamen, China. pp.1-6, ⟨10.1109/ICNSC52481.2021.9702231⟩
Communication dans un congrès
hal-03999943v1
|
|||
|
|
Energy Efficient Scheduling of MapReduce Jobs20th International Conference on Parallel Processing (Euro-Par 2014), Aug 2014, Porto, Portugal. pp.198-209, ⟨10.1007/978-3-319-09873-9_17⟩
Communication dans un congrès
hal-01020100v1
|
||
|
|
Online Non-preemptive Scheduling on Unrelated Machines with RejectionsSPAA 2018 - 30th ACM Symposium on Parallelism in Algorithms and Architectures, Jul 2018, Vienna, Austria. pp.291-300, ⟨10.1145/3210377.3210402⟩
Communication dans un congrès
hal-01986312v1
|
||
A generic approach for heterogeneous schedulingECCO 2015, the 28th Conference of the European Chapter on Combinatorial Optimization, Catania, Italy, May 28-30, 2015, Catania, Italy
Communication dans un congrès
hal-01230287v1
|
|||
|
|
Guaranteed-performance of robust algorithms for solving combinatorial optimization problems with imprecise and changing data23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France
Communication dans un congrès
hal-03595295v1
|
||
Green scheduling, flows and matchings23rd International Symposium on Algorithms and Computation (ISAAC 2012), Dec 2012, Taipei, Taiwan. pp.106--115, ⟨10.1007/978-3-642-35261-4_14⟩
Communication dans un congrès
hal-00820132v1
|
|||
|
|
Bounded max-colorings of graphsJournal of Discrete Algorithms, 2014, 26, pp.56-68. ⟨10.1016/j.jda.2013.11.003⟩
Article dans une revue
hal-01185103v1
|
||
Online Non-preemptive Scheduling to Minimize Maximum Weighted Flow-time on Related Machines14th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2019), Jun 2019, Renesse, Netherlands
Communication dans un congrès
hal-02416979v1
|
|||
|
|
Online maximum k-coverageDiscrete Applied Mathematics, 2012, 160 (13-14), pp.1901-1913. ⟨10.1016/j.dam.2012.04.005⟩
Article dans une revue
hal-01185270v1
|
||
|
|
Exact and approximation algorithms for DENSEST k-SUBGRAPH7th International Workshop on Algorithms and Computation (WALCOM 2013), Feb 2013, Kharagpur, India. pp.114-125, ⟨10.1007/978-3-642-36065-7_12⟩
Communication dans un congrès
hal-01215976v1
|
||
|
|
From preemptive to non-preemptive speed-scaling schedulingDiscrete Applied Mathematics, 2015, 181, pp.11-20. ⟨10.1016/j.dam.2014.10.007⟩
Article dans une revue
hal-01082393v1
|
||
|
|
Bounded max-colorings of graphs21st International Symposium on Algorithms and Computation (ISAAC 2010), Dec 2010, Jeju Island, South Korea. pp.353-365, ⟨10.1007/978-3-642-17517-6_32⟩
Communication dans un congrès
hal-01340674v1
|
||
The spectrum assigment (SA) problem in optical networks: A multiprocesor scheduling perspective18th Conference on Optical Network Design and Modeling (ONDM 2014), May 2014, Stockholm, Sweden. pp.55-60
Communication dans un congrès
hal-01215578v1
|
|||
|
|
Generic Algorithms for Scheduling Applications on Heterogeneous PlatformsConcurrency and Computation: Practice and Experience, 2018, pp.1-29. ⟨10.1002/cpe.4647⟩
Article dans une revue
hal-01896868v2
|
||
|
|
Ordonnancement Deux-Agents avec Augmentation de Ressources23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France
Communication dans un congrès
hal-03595369v1
|
||
|
|
Online Non-preemptive Scheduling in a Resource Augmentation Model based on DualityEuropean Symposium on Algorithms (ESA 2016), Aug 2016, Aarhus, Denmark. pp.1-17, ⟨10.4230/LIPIcs.ESA.2016.63⟩
Communication dans un congrès
hal-01334219v1
|
||
|
|
Primal-Dual and Dual-Fitting analysis of online scheduling algorithms for generalized flow time problems23rd European Symposium on Algorithms (ESA 2015), Sep 2015, Patras, Greece. pp.35--46, ⟨10.1007/978-3-662-48350-3_4⟩
Communication dans un congrès
hal-01227668v1
|
||
|
|
Primal–Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time ProblemsAlgorithmica, 2019, 81 (9), pp.3391-3421. ⟨10.1007/s00453-019-00583-8⟩
Article dans une revue
hal-02370807v1
|
||
|
|
Exact and superpolynomial approximation algorithms for the densest $k$-subgraph problemEuropean Journal of Operational Research, 2017, 262, pp.894 - 903. ⟨10.1016/j.ejor.2017.04.034⟩
Article dans une revue
hal-01539561v1
|
||
|
|
Energy Efficient Scheduling and Routing via Randomized RoundingROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Société française de recherche opérationnelle et d'aide à la décision, Feb 2014, Bordeaux, France
Communication dans un congrès
hal-00946354v1
|
||
Energy efficient scheduling and routing via randomized rounding33rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), Dec 2013, Guwahati, India. pp.449-460, ⟨10.4230/LIPIcs.FSTTCS.2013.449⟩
Communication dans un congrès
hal-01216504v1
|
|||
On multiprocessor temperature-aware scheduling problems6th International Frontiers of Algorithmics Workshop (FAW 2012) and 8th International Conference on Algorithmic Aspects of Information and Management (AAIM 2012), May 2012, Beijing, China. pp.149--160, ⟨10.1007/978-3-642-29700-7_14⟩
Communication dans un congrès
hal-00820172v1
|
|||
Exact Algorithms for Scheduling Programs with Shared Tasks1160, Springer International Publishing, pp.435-444, 2020, Advances in Intelligent Systems and Computing, ⟨10.1007/978-3-030-45691-7_40⟩
Proceedings/Recueil des communications
hal-03938886v1
|
|||
|
|
Scheduling at the Edge14th Scheduling for Large Scale Systems Workshop, Jun 2019, Bordeaux, France. pp.1-28
Communication dans un congrès
hal-02459646v1
|
||
|
|
Scheduling under Uncertainty: A Query-based ApproachIJCAI 2018 - 27th International Joint Conference on Artificial Intelligence, Jul 2018, Stockholm, Sweden. pp.4646-4652, ⟨10.24963/ijcai.2018/646⟩
Communication dans un congrès
hal-01924648v1
|
||
Interference-Aware Scheduling with 2D-Torus as a Case StudyJoint EURO/ORSC/ECCO Conference 2017 on Combinatorial Optimization, ECCO2017, May 2017, Koper, Slovenia
Communication dans un congrès
hal-01669062v1
|
|||
|
|
Approximating the max edge-coloring problem2009
Pré-publication, Document de travail
hal-00877049v1
|
||
Energy Minimization via a Primal-Dual Algorithm for a Convex Program12th International Symposium on Experimental Algorithms (SEA 2013), Jun 2013, Rome, Italy. pp.366--377, ⟨10.1007/978-3-642-38527-8_32⟩
Communication dans un congrès
istex
hal-00832023v1
|
|||
|
|
Exact and approximation algorithms for densest k-subgraph2012
Pré-publication, Document de travail
hal-00874586v1
|
||
|
|
Scheduling Malleable Jobs Under Topological Constraints35th IEEE International Parallel & Distributed Processing Symposium, May 2020, New Orleans, LA, United States. pp.316-325, ⟨10.1109/IPDPS47924.2020.00041⟩
Communication dans un congrès
hal-03173562v1
|