Suchergebnisse - "learning-augmented algorithm"
-
1
Learning-Augmented Online Minimization of Age of Information and Transmission Costs
ISSN: 2327-4697, 2334-329XVeröffentlicht: Piscataway IEEE 01.09.2025Veröffentlicht in IEEE transactions on network science and engineering (01.09.2025)“… We consider a discrete-time system where a resource-constrained source (e.g., a small sensor) transmits its time-sensitive data to a destination over a …”
Volltext
Journal Article -
2
AI-Augmented Parameter Initialization for QAOA
ISSN: 2325-6664Veröffentlicht: IEEE 23.06.2025Veröffentlicht in International Conference on Dependable Systems and Networks workshops (Online) (23.06.2025)“… The recent interest in learning-augmented algorithms has motivated us to explore their applicability in quantum computing, specifically during the noisy …”
Volltext
Tagungsbericht -
3
Learning-augmented Online Minimization of Age of Information and Transmission Costs
ISSN: 2833-0587Veröffentlicht: IEEE 20.05.2024Veröffentlicht in IEEE Conference on Computer Communications workshops (Online) (20.05.2024)“… We consider a discrete-time system where a resource-constrained source (e.g., a small sensor) transmits its time-sensitive data to a destination over a …”
Volltext
Tagungsbericht -
4
Incorporating predictions in online graph coloring algorithms
ISSN: 0166-218XVeröffentlicht: 30.01.2026Veröffentlicht in Discrete Applied Mathematics (30.01.2026)Volltext
Journal Article -
5
Learning-Augmented Scheduling
ISSN: 0018-9340, 1557-9956Veröffentlicht: IEEE 01.11.2024Veröffentlicht in IEEE transactions on computers (01.11.2024)“… The recent revival in learning theory has provided us with improved capabilities for accurate predictions. This work contributes to an emerging research agenda …”
Volltext
Journal Article -
6
Boosting Double Coverage for k-Server via Imperfect Predictions
ISSN: 0178-4617, 1432-0541Veröffentlicht: New York Springer US 01.11.2025Veröffentlicht in Algorithmica (01.11.2025)“… We study the online k -server problem in a learning-augmented setting. While in the traditional online model, an algorithm has no information about the request …”
Volltext
Journal Article -
7
Learning-augmented algorithms for online subset sum
ISSN: 0925-5001, 1573-2916Veröffentlicht: New York Springer US 01.11.2023Veröffentlicht in Journal of global optimization (01.11.2023)“… As one of Karp’s 21 NP-complete problems, the subset sum problem, as well as its generalization, has been well studied. Among the rich literature, there is …”
Volltext
Journal Article -
8
Robust machine-learned algorithms for efficient grid operation
ISSN: 2634-4602, 2634-4602Veröffentlicht: Cambridge University Press 22.04.2025Veröffentlicht in Environmental Data Science (22.04.2025)“… Increasing penetration of variable and intermittent renewable energy resources on the energy grid poses a challenge for reliable and efficient grid operation, …”
Volltext
Journal Article -
9
Online Dynamic Acknowledgement with Learned Predictions
ISSN: 2641-9874Veröffentlicht: IEEE 17.05.2023Veröffentlicht in Annual Joint Conference of the IEEE Computer and Communications Societies (17.05.2023)“… We revisit the online dynamic acknowledgment problem. In the problem, a sequence of requests arrive over time to be acknowledged, and all outstanding requests …”
Volltext
Tagungsbericht