Výsledky vyhľadávania - "learning-augmented algorithm"

Non-clairvoyant Scheduling with Partial Predictions

Autori: Benomar, Ziyad Perchet, Vianney

Prispievatelia: Benomar, Ziyad Perchet, Vianney

Predmety: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], FOS: Computer and information sciences, Computer Science - Machine Learning, Competitive analysis, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, Computer Science - Data Structures and Algorithms, Online algorithms, Scheduling Algorithm, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Data Structures and Algorithms (cs.DS), Learning augmented algorithm, Machine Learning (cs.LG)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2405.01013
https://hal.science/hal-04709576v1
https://hal.science/hal-04709576v1/document

Non-Clairvoyant Makespan Minimization Scheduling with Predictions

Autori: Bampis, Evripidis Kononov, Alexander Lucarelli, Giorgio a ďalší

Prispievatelia: Bampis, Evripidis Kononov, Alexander Lucarelli, Giorgio a ďalší

Predmety: Theory of computation → Design and analysis of algorithms, learning-augmented algorithm, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], scheduling, ddc:004, online

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.9

Canadian Traveller Problem with Predictions

Autori: Bampis, Evripidis Escoffier, Bruno Xefteris, Michalis

Prispievatelia: Bampis, Evripidis Escoffier, Bruno Xefteris, Michalis

Zdroj: Lecture Notes in Computer Science ISBN: 9783031183669

Predmety: FOS: Computer and information sciences, Online algorithm, Computer Science - Data Structures and Algorithms, Canadian Traveller Problem, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, [INFO] Computer Science [cs], 01 natural sciences, Learning augmented algorithm

Prístupová URL adresa: http://arxiv.org/abs/2209.11100
https://hal.science/hal-03880690v1
https://doi.org/10.1007/978-3-031-18367-6_6

A Universal Error Measure for Input Predictions Applied to Online Graph Problems

Autori: Giulia Bernardini Alexander Lindermayr Alberto Marchetti-Spaccamela a ďalší

Prispievatelia: Giulia Bernardini Alexander Lindermayr Alberto Marchetti-Spaccamela a ďalší

Predmety: Network design problems, FOS: Computer and information sciences, Computer Science - Machine Learning, Routing problem, Online graph problem, 0211 other engineering and technologies, Algorithms with prediction, 0102 computer and information sciences, 02 engineering and technology, Learning-augmented algorithms, Algorithms with predictions, Error measures, Online graph problems, Routing problems, 01 natural sciences, Capture error, Graph problems, Hyper graph, Hyperedges, Minimum cost, Performance guarantees, Steiner trees, Tree location, Machine Learning (cs.LG), Computer Science - Data Structures and Algorithms, Learning-augmented algorithm, Data Structures and Algorithms (cs.DS), Error measure

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2205.12850
https://hdl.handle.net/11368/3052519
https://proceedings.neurips.cc/paper_files/paper/2022/hash/15212bd2265c4a3ab0dbc1b1982c1b69-Abstract-Conference.html
https://research.vu.nl/en/publications/91e9ecfb-fa45-469b-9b36-0c487d9f0a0b
https://hdl.handle.net/1871.1/91e9ecfb-fa45-469b-9b36-0c487d9f0a0b
https://hdl.handle.net/2434/1131795
https://proceedings.neurips.cc/paper_files/paper/2022/hash/15212bd2265c4a3ab0dbc1b1982c1b69-Abstract-Conference.html
https://hdl.handle.net/11573/1685775

Online Primal-Dual Algorithm with Predictions for Non-Linear Covering Problems

Autori: Kevi, Enikő Thắng, Nguyễn, Kim Data Aware Large Scale Computing (DATAMOVE) a ďalší

Prispievatelia: Kevi, Enikő Thắng, Nguyễn, Kim Data Aware Large Scale Computing (DATAMOVE) a ďalší

Zdroj: https://hal.science/hal-04361128 ; 2023.

Predmety: Predictions, Online algorithm with advice, Covering problems, Primal-dual Algorithm, learning-augmented algorithm, non-linear objective, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

Dostupnosť: https://hal.science/hal-04361128
https://hal.science/hal-04361128v1/document
https://hal.science/hal-04361128v1/file/main.pdf

Online Covering with Multiple Experts

Autori: Kevi, Enikő Thắng, Nguyễn, Kim Laboratoire d'Informatique de Grenoble (LIG) a ďalší

Prispievatelia: Kevi, Enikő Thắng, Nguyễn, Kim Laboratoire d'Informatique de Grenoble (LIG) a ďalší

Zdroj: https://hal.science/hal-04297794 ; 2023.

Predmety: primal-dual, online covering, convex regularization, learning-augmented algorithm, multiple experts, online algorithm, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

Dostupnosť: https://hal.science/hal-04297794
https://hal.science/hal-04297794v1/document
https://hal.science/hal-04297794v1/file/main.pdf

A Universal Error Measure for Input Predictions Applied to Online Graph Problems

Autori: Bernardini G. Lindermayr A. Marchetti-Spaccamela A. a ďalší

Prispievatelia: Bernardini G. Lindermayr A. Marchetti-Spaccamela A. a ďalší

Predmety: Learning-augmented algorithm, Algorithms with prediction, Error measure, Online graph problem, Routing problem, Network design problems

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:001213927501012; ispartofbook:Advances in Neural Information Processing Systems; 36th Conference on Neural Information Processing Systems, NeurIPS 2022; volume:35; firstpage:"-"; lastpage:"-"; numberofpages:13; serie:ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS; https://hdl.handle.net/11368/3052519

Dostupnosť: https://hdl.handle.net/11368/3052519
https://proceedings.neurips.cc/paper_files/paper/2022/hash/15212bd2265c4a3ab0dbc1b1982c1b69-Abstract-Conference.html

Non-Clairvoyant Makespan Minimization Scheduling with Predictions

Autori: Evripidis Bampis and Alexander Kononov and Giorgio Lucarelli and Fanny Pascual Bampis, Evripidis Kononov, Alexander a ďalší

Témy: scheduling, online, learning-augmented algorithm, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.9
Is Part Of LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023)