يعرض 1 - 2 نتائج من 2 نتيجة بحث عن '"Julien Hemery"', وقت الاستعلام: 0.72s تنقيح النتائج
  1. 1
    On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem

    المؤلفون: Pierre Bergé, Joanna Tomasik, Arpad Rimmel, Julien Hemery

    المساهمون: Graphes, Algorithmes et Combinatoire (LRI) (GALaC - LRI), Laboratoire de Recherche en Informatique (LRI), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)

    المصدر: Combinatorial Optimization and Applications ISBN: 9783030046507
    COCOA
    International Conference Combinatorial Optimization and Applications (COCOA)
    International Conference Combinatorial Optimization and Applications (COCOA), Dec 2018, Atlanta, United States

    مصطلحات موضوعية: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], 021103 operations research, Traverse, Competitive analysis, Computer science, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Graph, Combinatorics, 010201 computation theory & mathematics, Shortest path problem, Online algorithm, Canadian traveller problem, ComputingMilieux_MISCELLANEOUS, MathematicsofComputing_DISCRETEMATHEMATICS

    URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8ed8f5718117c0efb39d17995251b3a6
    https://doi.org/10.1007/978-3-030-04651-4_38

    أضف إلى المفضلة
  2. 2
    The Competitiveness of Randomized Strategies for Canadians via Systems of Linear Inequalities

    المؤلفون: Arpad Rimmel, Julien Hemery, Pierre Bergé, Joanna Tomasik

    المساهمون: Graphes, Algorithmes et Combinatoire (LRI) (GALaC - LRI), Laboratoire de Recherche en Informatique (LRI), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)

    المصدر: Communications in Computer and Information Science ISBN: 9783030008390
    ISCIS
    International Symposium on Computer and Information Sciences
    International Symposium on Computer and Information Sciences, Sep 2018, Poznan, Poland

    مصطلحات موضوعية: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], Discrete mathematics, 021103 operations research, Optimization problem, Computer science, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Linear inequality, 010201 computation theory & mathematics, Graph (abstract data type), Canadian traveller problem, ComputingMilieux_MISCELLANEOUS, MathematicsofComputing_DISCRETEMATHEMATICS

    URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dec56ec0a85e2c4c01e41ee13ba5a686
    https://doi.org/10.1007/978-3-030-00840-6_11

    أضف إلى المفضلة
أدوات البحث: أحصل على تغذية RSS – أرسل هذا البحث بالبريد الإلكتروني – حفظ البحث – جدول التنبيهات: لا شيء