Gotowa bibliografia na temat „Explorable uncertainty”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Explorable uncertainty”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Explorable uncertainty"
Focke, Jacob, Nicole Megow i Julie Meißner. "Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments". ACM Journal of Experimental Algorithmics 25 (8.11.2020): 1–20. http://dx.doi.org/10.1145/3422371.
Pełny tekst źródłaMansour, Yishay, Alex Slivkins, Vasilis Syrgkanis i Zhiwei Steven Wu. "Bayesian Exploration: Incentivizing Exploration in Bayesian Games". Operations Research 70, nr 2 (marzec 2022): 1105–27. http://dx.doi.org/10.1287/opre.2021.2205.
Pełny tekst źródłaMathwieser, Corinna, i Eranda Çela. "Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty". Networks, 11.01.2024. http://dx.doi.org/10.1002/net.22204.
Pełny tekst źródłaErlebach, Thomas, Michael Hoffmann i Murilo Santos de Lima. "Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries". Algorithmica, 15.09.2022. http://dx.doi.org/10.1007/s00453-022-01035-6.
Pełny tekst źródłaAnselmi, Jonatha, i Josu Doncel. "Load Balancing with Job-Size Testing: Performance Improvement or Degradation?" ACM Transactions on Modeling and Performance Evaluation of Computing Systems, 4.03.2024. http://dx.doi.org/10.1145/3651154.
Pełny tekst źródłaRozprawy doktorskie na temat "Explorable uncertainty"
Dogeas, Konstantinos. "Energy Minimization, Data Movement and Uncertainty : Models and Algorithms". Electronic Thesis or Diss., Sorbonne université, 2022. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2022SORUS070.pdf.
Pełny tekst źródłaHigh performance computers (HPCs) is the go-to solution for running computationally demanding applications. As the limit of energy consumption is already achieved, the need for more energy efficient algorithms is critical.Taking advantage of the core characteristics of an HPC, such as its network topology and the heterogeneity of the machines, could lead to better scheduling algorithms. In addition, designing more realistic models, that grasp the features of real-life applications, is a work in the same direction of achieving better performance. Allowing scheduling algorithms to decide either the amount of resources allocated to an application or the running speed of the resources can pave the path to new platform-aware implementations. In the first part of the thesis, we introduce a model which takes into account both the topology and the heterogeneity of a platform by introducing two kind of machines. We augment the scheduling problem with constraints whose purpose is to implicitly reduce data movement either during parallel execution or during the communication with the file system. We propose algorithms that can decide the number of resources allocated to an application taking into consideration the extra constraints.In the second part of the thesis, we deal with the uncertainty on part of the input and more specifically, the workload of an application, that is strictly related to the time needed for its completion. Most works in the literature consider this value known in advance. However, this is rarely the case in real-life systems.In our approach, the given workload is a worst case scenario for the execution of an application. We introduce application-specific tests that may decrease the workload of a task.Since the test (e.g. compression) takes some time, and since the amount of reduction (e.g. in size) is unknown before the completion of the test, the decision of running the test for a task or not has to be taken. We propose competitive algorithms for the problem of scheduling such tasks, in order to minimize the energy consumed in a set of speed-adjustable machines. In the third part of the thesis, we focus on a similar setting of uncertain input and we consider a model where the processing times are not known in advance. Here, we augment the input of the problem by introducing predicted values in place of the unknown processing times. We design algorithms that perform optimally when the predictions are accurate while remaining competitive to the best known ones otherwise
Części książek na temat "Explorable uncertainty"
Megow, Nicole, i Jens Schlöter. "Explorable Uncertainty Meets Decision-Making in Logistics". W Dynamics in Logistics, 35–56. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-88662-2_2.
Pełny tekst źródłaErlebach, Thomas. "Computing and Scheduling with Explorable Uncertainty". W Sailing Routes in the World of Computation, 156–60. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94418-0_16.
Pełny tekst źródłaLiu, Alison Hsiang-Hsuan, Fu-Hong Liu, Prudence W. H. Wong i Xiao-Ou Zhang. "The Power of Amortization on Scheduling with Explorable Uncertainty". W Approximation and Online Algorithms, 90–103. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-49815-2_7.
Pełny tekst źródłaAlbers, Susanne, i Alexander Eckl. "Explorable Uncertainty in Scheduling with Non-uniform Testing Times". W Approximation and Online Algorithms, 127–42. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-80879-2_9.
Pełny tekst źródłaMegow, Nicole, i Jens Schlöter. "Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques". W Integer Programming and Combinatorial Optimization, 319–33. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-32726-1_23.
Pełny tekst źródłaStreszczenia konferencji na temat "Explorable uncertainty"
Bampis, Evripidis, Konstantinos Dogeas, Alexander Kononov, Giorgio Lucarelli i Fanny Pascual. "Speed Scaling with Explorable Uncertainty". W SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3409964.3461812.
Pełny tekst źródłaErlebach, Thomas, Murilo de Lima, Nicole Megow i Jens Schlöter. "Sorting and Hypergraph Orientation under Uncertainty with Predictions". W Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/619.
Pełny tekst źródłaMauricio, Cristóbal Alfredo, Sebastian Davila-Gálvez i Óscar Carlos Vasquez. "When a test-taking strategy is better? An approach from the paradigm of scheduling under explorable uncertainty". W Ninth International Conference on Higher Education Advances. Valencia: Universitat Politècnica de València, 2023. http://dx.doi.org/10.4995/head23.2023.16371.
Pełny tekst źródła