Image de couverture de livre

Adaptive control of dynamic networks

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Pan, Chunyu, Zhang, Xizhe, Zheng, Haoyu, Su, Zhao, Zhang, Changsheng, Zhang, Weixiong
Format:	Preprint
Publié:	2023
Sujets:	Systems and Control Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems
par: Van Over, Brandon, et autres
Publié: (2024)

On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures
par: Li, Bowen, et autres
Publié: (2024)

Computational Complexity Analysis of Interval Methods in Solving Uncertain Nonlinear Systems
par: Prakash, Rudra, et autres
Publié: (2026)

Warehouse storage and retrieval optimization via clustering, dynamical systems modeling, and GPU-accelerated routing
par: Bengtsson, Magnus, et autres
Publié: (2025)

Platoon Forming Algorithms for Intelligent Street Intersections
par: Timmerman, R. W., et autres
Publié: (2019)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
par: Su, Yuexin, et autres
Publié: (2026)

Competitive Online Optimization under Inventory Constraints
par: Lin, Qiulin, et autres
Publié: (2019)

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem
par: Gao, Xuan-Zhao, et autres
Publié: (2024)

Online Smoothed Demand Management
par: Lechowicz, Adam, et autres
Publié: (2025)

The Bounded Acceleration Shortest Path problem: complexity and solution algorithms
par: Ardizzoni, Stefano, et autres
Publié: (2021)

Optimum Noise Mechanism for Differentially Private Queries in Discrete Finite Sets
par: Kadam, Sachin, et autres
Publié: (2021)

High Probability Latency Sequential Change Detection over an Unknown Finite Horizon
par: Huang, Yu-Han, et autres
Publié: (2024)

Robust Dynamic Staffing with Predictions
par: Feng, Yiding, et autres
Publié: (2025)

A Variational-Calculus Approach to Online Algorithm Design and Analysis
par: Xu, Pan
Publié: (2025)

Periodic trajectories in P-time event graphs and the non-positive circuit weight problem
par: Zorzenon, Davide, et autres
Publié: (2021)

Total controllability analysis discovers explainable drugs for Covid-19 treatment
par: Wei, Xinru, et autres
Publié: (2022)

Adaptive Matrix Sparsification and Applications to Empirical Risk Minimization
par: Liu, Yang P., et autres
Publié: (2025)

Dynamic Pricing for Reusable Resources: The Power of Two Prices
par: Balseiro, Santiago R., et autres
Publié: (2023)

The Restricted Inverse Optimal Value Problem under Weighted Bottle-neck Hamming distance on trees
par: Zhang, Qiao, et autres
Publié: (2024)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
par: Housni, Omar El, et autres
Publié: (2024)

Balancing Gradient and Hessian Queries in Non-Convex Optimization
par: Adil, Deeksha, et autres
Publié: (2025)

Isotropic Noise in Stochastic and Quantum Convex Optimization
par: Marsden, Annie, et autres
Publié: (2025)

Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs
par: Li, Tongyang, et autres
Publié: (2024)

A Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems
par: Zhou, Yi, et autres
Publié: (2025)

Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
par: Li, Xizhe, et autres
Publié: (2026)

Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
par: Gu, Yuzhou, et autres
Publié: (2023)

Optimal Scalarizations for Sublinear Hypervolume Regret
par: Zhang, Qiuyi
Publié: (2023)

Availability is all you need: achieving optimal regret with minimal information for dynamic matching
par: Kerimov, Süleyman, et autres
Publié: (2025)

Gradient Testing and Estimation by Comparisons
par: Tao, Xiwen, et autres
Publié: (2024)

Quantum speedups for stochastic optimization
par: Sidford, Aaron, et autres
Publié: (2023)

Adaptivity Gaps for Stochastic Probing with Subadditive Functions
par: Li, Jian, et autres
Publié: (2025)

Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss
par: Wang, Hao, et autres
Publié: (2024)

Infrequent Resolving Algorithm for Online Linear Programming
par: Li, Guokai, et autres
Publié: (2024)

On Differential Privacy for Adaptively Solving Search Problems via Sketching
par: Feng, Shiyuan, et autres
Publié: (2025)

Faster feasibility for dynamic flows and transshipments on temporal networks
par: Sheridan, Kristin, et autres
Publié: (2024)

Labeling Methods for Partially Ordered Paths
par: Euler, Ricardo, et autres
Publié: (2023)

Sparse Submodular Function Minimization
par: Graur, Andrei, et autres
Publié: (2023)

A First Order Method for Linear Programming Parameterized by Circuit Imbalance
par: Cole, Richard, et autres
Publié: (2023)

Acceleration by Stepsize Hedging I: Multi-Step Descent and the Silver Stepsize Schedule
par: Altschuler, Jason M., et autres
Publié: (2023)

Continuous Non-monotone DR-submodular Maximization with Down-closed Convex Constraint
par: Chen, Shengminjie, et autres
Publié: (2023)