-
1Academic Journal
المؤلفون: Anselmi, Jonatha, Doncel, Josu
المساهمون: Performance analysis and optimization of LARge Infrastructures and Systems (POLARIS), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA), Universidad del País Vasco Espainia / Euskal Herriko Unibertsitatea España = University of the Basque Country Spain = Université du pays basque Espagne (UPV / EHU)
المصدر: ISSN: 2376-3639.
مصطلحات موضوعية: Load balancing, dispatching policies, size-based routing, scheduling with testing, explorable uncertainty, [INFO]Computer Science [cs]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2304.00899; ARXIV: 2304.00899
-
2Academic Journal
المساهمون: Thomas Erlebach and Murilo Santos de Lima and Nicole Megow and Jens Schlöter
مصطلحات موضوعية: explorable uncertainty, queries, untrusted predictions
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.49
-
3Conference
المؤلفون: Bampis, Evripidis, Dogeas, Konstantinos, Kononov, Alexander, Lucarelli, Giorgio, Pascual, Fanny
المساهمون: Recherche Opérationnelle (RO), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Novosibirsk State University (NSU), Laboratoire de Conception, Optimisation et Modélisation des Systèmes (LCOMS), Université de Lorraine (UL), ACM, ANR-18-CE25-0008,Energumen,Optimiser l'énergie des plates-formes de calcul à large échelle(2018)
المصدر: SPAA '21: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures ; 33th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2021) ; https://hal.science/hal-03389776 ; 33th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2021), ACM, Jul 2021, virtual conference, United States. pp.83-93, ⟨10.1145/3409964.3461812⟩
مصطلحات موضوعية: Online algorithms, Adversary models speed scaling, scheduling, explorable uncertainty, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
جغرافية الموضوع: virtual conference, United States
Time: virtual conference, United States
-
4Conference
المؤلفون: Thomas Erlebach, Michael Hoffmann, Murilo S de Lima
مصطلحات موضوعية: Uncategorized, online algorithms, competitive analysis, explorable uncertainty, parallelalgorithms, minimum problem, selection problem
-
5Academic Journal
المؤلفون: Bampis, Evripidis, Dürr, Christoph, Erlebach, Thomas, de Lima, Murilo Santos, Megow, Nicole, Schlöter, Jens
المساهمون: Evripidis Bampis and Christoph Dürr and Thomas Erlebach and Murilo Santos de Lima and Nicole Megow and Jens Schlöter
مصطلحات موضوعية: Explorable uncertainty, queries, stochastic optimization, graph orientation, selection problems
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.10
-
6Academic Journal
المؤلفون: Erlebach, Thomas, Hoffmann, Michael, de Lima, Murilo Santos
المساهمون: Thomas Erlebach and Michael Hoffmann and Murilo Santos de Lima
مصطلحات موضوعية: online algorithms, competitive analysis, explorable uncertainty, parallel algorithms, minimum problem, selection problem
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 187, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.27
-
7Dissertation/ Thesis
المؤلفون: Lee, Eunji
المساهمون: Minner, Stefan (Prof. Dr.), Fleischmann, Moritz (Prof. Dr.)
مصطلحات موضوعية: info:eu-repo/classification/ddc/650, Management, Öffentlichkeitsarbeit, Bilateral information sharing, Bayesian update, Stochastic dominance, Explorable uncertainty, Risk-aversion, Stackelberg game, Power structure, Pricing decision, Bilateraler Informationsaustausch, Bayes'sche Aktualisierung, Stochastische Dominanz, Explorierbare Unsicherheit, Risikoaversion, Stackelberg-Spiel, Machtstruktur, Preisentscheidung
وصف الملف: application/pdf
Relation: https://mediatum.ub.tum.de/1725959; https://mediatum.ub.tum.de/doc/1725959/document.pdf; http://nbn-resolving.de/urn:nbn:de:bvb:91-diss-20240111-1725959-1-4
-
8Academic Journal
المؤلفون: Dürr, Christoph, Erlebach, Thomas, Megow, Nicole, Meißner, Julie
مصطلحات موضوعية: Explorable uncertainty, Competitive analysis, Lower bounds, Scheduling, 510 Mathematics, ddc:510
Time: 510
وصف الملف: application/pdf
Relation: #PLACEHOLDER_PARENT_METADATA_VALUE#; Matheon; EPSRC Grant; ANR Grant; Algorithmica; ME 3825/1; EP/S033483/1; ANR-18-CE25-0008; https://media.suub.uni-bremen.de/handle/elib/8156; https://doi.org/10.26092/elib/3190; urn:nbn:de:gbv:46-elib81565
-
9Conference
المؤلفون: Dürr, Christoph, Erlebach, Thomas, Megow, Nicole, Meißner, Julie
مصطلحات موضوعية: online scheduling, explorable uncertainty, competitive ratio, makespan, sum of completion times
Relation: Leibniz International Proceedings in Informatics, LIPIcs, 2018, 94; http://drops.dagstuhl.de/opus/volltexte/2018/8336/; http://hdl.handle.net/2381/42259
-
10Conference
المؤلفون: Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner
مصطلحات موضوعية: Uncategorized, online scheduling, explorable uncertainty, competitive ratio, makespan, sum of completion times
-
11Academic Journal
المؤلفون: Focke, Jacob, Megow, Nicole, Meißner, Julie
المساهمون: Jacob Focke and Nicole Megow and Julie Meißner
مصطلحات موضوعية: MST, explorable uncertainty, competitive ratio, experimental algorithms
وصف الملف: application/pdf
Relation: Is Part Of LIPIcs, Volume 75, 16th International Symposium on Experimental Algorithms (SEA 2017); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2017.22
-
12Dissertation/ Thesis
المؤلفون: Schlöter, Jens
المساهمون: Megow, Nicole, Svensson, Ola
مصطلحات موضوعية: Explorable uncertainty, Algorithms, Optimization, ddc:0
Time: 0
وصف الملف: application/pdf
Relation: https://media.suub.uni-bremen.de/handle/elib/7562; https://doi.org/10.26092/elib/2729; urn:nbn:de:gbv:46-elib75623
-
13
المؤلفون: Eckl, Alexander
المساهمون: Albers, Susanne (Prof. Dr.), Schulz, Andreas (Prof. Dr.)
مصطلحات موضوعية: ddc:000, Informatik, Wissen, Systeme, online scheduling, competitive analysis, explorable uncertainty, scheduling with testing, makespan, sum of completion times, Online Zeitplanerstellung, kompetitive Analysis, erkundbare Unsicherheit, Zeitplanerstellung mit Tests, Produktionsspanne, Summe der Komplettierungszeiten
وصف الملف: application/pdf
-
14Dissertation/ Thesis
المؤلفون: Eckl, Alexander
المساهمون: Albers, Susanne (Prof. Dr.), Schulz, Andreas (Prof. Dr.)
مصطلحات موضوعية: info:eu-repo/classification/ddc/000, Informatik, Wissen, Systeme, online scheduling, competitive analysis, explorable uncertainty, scheduling with testing, makespan, sum of completion times, Online Zeitplanerstellung, kompetitive Analysis, erkundbare Unsicherheit, Zeitplanerstellung mit Tests, Produktionsspanne, Summe der Komplettierungszeiten
وصف الملف: application/pdf
Relation: https://mediatum.ub.tum.de/1621766; https://mediatum.ub.tum.de/doc/1621766/document.pdf; http://nbn-resolving.de/urn:nbn:de:bvb:91-diss-20220328-1621766-1-2
-
15Dissertation/ Thesis
المؤلفون: Dogeas, Konstantinos
المساهمون: Recherche Opérationnelle (RO), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Sorbonne Université, Evripidis Bampis, Fanny Pascual
المصدر: https://theses.hal.science/tel-03803990 ; Distributed, Parallel, and Cluster Computing [cs.DC]. Sorbonne Université, 2022. English. ⟨NNT : 2022SORUS070⟩.
مصطلحات موضوعية: Scheduling, Energy minimization, Topological constraints, Explorable uncertainty, Predictions, Competitive algorithms, Approximation algorithms, Minimisation de l'énergie, Mouvements de données, Données incertaines, Algorithmes, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Relation: NNT: 2022SORUS070; tel-03803990; https://theses.hal.science/tel-03803990; https://theses.hal.science/tel-03803990/document; https://theses.hal.science/tel-03803990/file/DOGEAS_Konstantinos_these_2022.pdf
-
16
المؤلفون: Konstantinos Dogeas, Fanny Pascual, Giorgio Lucarelli, Evripidis Bampis, Alexander V. Kononov
المساهمون: Recherche Opérationnelle (RO), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Laboratoire de Conception, Optimisation et Modélisation des Systèmes (LCOMS), Université de Lorraine (UL), ACM, ANR-18-CE25-0008,Energumen,Optimiser l'énergie des plates-formes de calcul à large échelle(2018)
المصدر: SPAA '21: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures
33th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2021)
33th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2021), ACM, Jul 2021, virtual conference, United States. pp.83-93, ⟨10.1145/3409964.3461812⟩
SPAAمصطلحات موضوعية: Mathematical optimization, 021103 operations research, Computer science, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0211 other engineering and technologies, Adversary models speed scaling, Online algorithms, Workload, 0102 computer and information sciences, 02 engineering and technology, Energy consumption, Program optimization, 01 natural sciences, Upper and lower bounds, Scheduling (computing), Computer Science::Performance, 010201 computation theory & mathematics, Time windows, scheduling, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Speed scaling, Computer Science::Operating Systems, explorable uncertainty, Computer Science::Distributed, Parallel, and Cluster Computing, Data compression
-
17Academic Journal
المؤلفون: Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner
مصطلحات موضوعية: Uncategorized, Explorable uncertainty, Competitive analysis, Lower bounds, Scheduling
Relation: 2381/12651608.v1; https://figshare.com/articles/journal_contribution/An_Adversarial_Model_for_Scheduling_with_Testing/12651608
-
18
مصطلحات موضوعية: Clairvoyant Scheduling, Non-Clairvoyant Scheduling, Explorable Uncertainty, Learning Augmented Algorithms, Competitive Analysis, Round Robin Algorithm, Χρονοδρομολόγηση Αγνώστου Μεγέθους Εργασιών, Ανάλυση Δυσκολότερου Στιγμιότυπου, Αλγόριθμος Κυκλικής Χρονοδρομολόγησης, Αλγόριθμοι Καθοδηγούμενοι από Μηχανική Μάθηση, Χρονοδρομολόγηση υπό Αβεβαιότητα
وصف الملف: application/pdf
Relation: https://dspace.lib.ntua.gr/xmlui/handle/123456789/56548; http://dx.doi.org/10.26240/heal.ntua.24246
-
19Electronic Resource
Additional Titles: Informationsaustausch und Koordination in Lieferketten
المؤلفون: Minner, Stefan (Prof. Dr.), Minner, Stefan (Prof. Dr.);Fleischmann, Moritz (Prof. Dr.), Lee, Eunji
مصطلحات الفهرس: info:eu-repo/classification/ddc/650, Management, Öffentlichkeitsarbeit, Bilateral information sharing; Bayesian update; Stochastic dominance; Explorable uncertainty; Risk-aversion; Stackelberg game; Power structure; Pricing decision, Bilateraler Informationsaustausch; Bayes'sche Aktualisierung; Stochastische Dominanz; Explorierbare Unsicherheit; Risikoaversion; Stackelberg-Spiel; Machtstruktur; Preisentscheidung, thesis, doc-type:doctoralThesis
-
20Electronic Resource
Additional Titles: Online-Algorithmen für Zeitplanerstellung mit Tests
المؤلفون: Albers, Susanne (Prof. Dr.), Albers, Susanne (Prof. Dr.);Schulz, Andreas (Prof. Dr.), Eckl, Alexander
مصطلحات الفهرس: info:eu-repo/classification/ddc/000, Informatik, Wissen, Systeme, online scheduling, competitive analysis, explorable uncertainty, scheduling with testing, makespan, sum of completion times, Online Zeitplanerstellung, kompetitive Analysis, erkundbare Unsicherheit, Zeitplanerstellung mit Tests, Produktionsspanne, Summe der Komplettierungszeiten, thesis, doc-type:doctoralThesis