Optimality of Robust Online Learning.

Autori: Guo, Zheng-Chu¹ (AUTHOR), Christmann, Andreas² (AUTHOR), Shi, Lei³ (AUTHOR) leishi@fudan.edu.cn

Fonte: Foundations of Computational Mathematics. Oct2024, Vol. 24 Issue 5, p1455-1483. 29p.

Soggetti: *MACHINE learning, *ONLINE algorithms, *ONLINE education, *HILBERT space, *FUNCTION spaces

The algorithmic phase transition of random graph alignment problem.

Autori: Du, Hang¹ (AUTHOR), Gong, Shuyang² (AUTHOR) gongshuyang@stu.pku.edu.cn, Huang, Rundong² (AUTHOR)

Fonte: Probability Theory & Related Fields. Apr2025, Vol. 191 Issue 3, p1233-1288. 56p.

Soggetti: *MATHEMATICS, *ALGORITHMS, PHASE transitions, ONLINE algorithms, HARDNESS, RANDOM graphs

Online Scheduling on a Parallel‐Batch Machine With Pulse Interruptions.

Autori: Lin, Ran¹ (AUTHOR), Wang, Jun‐Qiang^2,3 (AUTHOR) wangjq@nwpu.edu.cn, Liu, Zhixin⁴ (AUTHOR), Xu, Jun⁵ (AUTHOR)

Fonte: Naval Research Logistics. Mar2025, p1. 15p. 5 Illustrations.

Soggetti: *BATCH processing, *PRODUCTION scheduling, *SCHEDULING, *MACHINERY, ONLINE algorithms

Constant-competitiveness for random assignment Matroid secretary without knowing the Matroid: Constant-competitiveness for random...: R. Santiago et al.

Autori: Santiago, Richard¹ (AUTHOR) rtorres@ethz.ch, Sergeev, Ivan¹ (AUTHOR) isergeev@ethz.ch, Zenklusen, Rico¹ (AUTHOR) ricoz@ethz.ch

Fonte: Mathematical Programming. Mar2025, Vol. 210 Issue 1, p815-846. 32p.

Soggetti: ONLINE algorithms, LEARNING curve, INDEPENDENT sets, OPEN-ended questions, LOGICAL prediction, MATROIDS

A nearly optimal randomized algorithm for explorable heap selection: A nearly optimal randomized algorithm...: S. Borst et al.

Autori: Borst, Sander¹ (AUTHOR) sander.borst@cwi.nl, Dadush, Daniel^1,2 (AUTHOR) d.n.dadush@uu.nl, Huiberts, Sophie³ (AUTHOR) sophie@huiberts.me, Kashaev, Danish¹ (AUTHOR) danish.kashaev@cwi.nl

Fonte: Mathematical Programming. Mar2025, Vol. 210 Issue 1, p75-96. 22p.

Soggetti: *PROBLEM solving, *TIME management, *ALGORITHMS, ONLINE algorithms, SAWLOGS, DETERMINISTIC algorithms

Online scheduling problem of incompatible batch processing with deterioration effect and delivery time in the steel rolling process.

Autori: Ma, Ran¹ (AUTHOR) sungirlmr@126.com, Meng, Lanmeng¹ (AUTHOR), Zhang, Yuzhong² (AUTHOR)

Fonte: Journal of the Operational Research Society. Mar2025, Vol. 76 Issue 3, p454-465. 12p.

Soggetti: *BATCH processing, *SCHEDULING, *CONSUMERS, ONLINE algorithms, ROLLING (Metalwork)

A competitive algorithm for throughput maximization on identical machines.

Autori: Moseley, Benjamin¹ (AUTHOR), Pruhs, Kirk² (AUTHOR), Stein, Clifford³ (AUTHOR), Zhou, Rudy¹ (AUTHOR) rbz@andrew.cmu.edu

Fonte: Mathematical Programming. Jul2024, Vol. 206 Issue 1/2, p497-514. 18p.

Soggetti: *ONLINE algorithms, *DETERMINISTIC algorithms, *MACHINERY, *ALGORITHMS

Active defect discovery: A human-in-the-loop learning method.

Autori: Shen, Bo¹ (AUTHOR), Kong, Zhenyu² (AUTHOR) zkong@vt.edu

Fonte: IISE Transactions. Jun2024, Vol. 56 Issue 6, p638-651. 14p.

Soggetti: *ONLINE algorithms, *DETECTORS, *ALGORITHMS

Bias, Skew, and Search Engines Are Sufficient to Explain Online Toxicity.

Autori: Farrell, Henry¹ (AUTHOR) cshalizi@cmu.edu, Shalizi, Cosma² (AUTHOR) henry.farrell@gmail.com

Fonte: Communications of the ACM. Apr2024, Vol. 67 Issue 4, p25-28. 4p.

Soggetti: *SEARCH engines, ONLINE algorithms, DISCOURSE, ANONYMITY, SOCIAL media, CITIZENSHIP

Online Menu-Based Scheduling of Electric Vehicle Charging

Autori: Mathioudaki, A., Tsaousoglou, G., Varvarigos, E., Fotakis, D.

Fonte: IEEE Transactions on Smart Grid IEEE Trans. Smart Grid Smart Grid, IEEE Transactions on. 16(3):2478-2491 May, 2025

The simple macroeconomics of AI.

Autori: Acemoglu, Daron¹ (AUTHOR)

Fonte: Economic Policy. Jan2025, Vol. 40 Issue 121, p13-58. 46p.

Soggetti: *INCOME inequality, *ARTIFICIAL intelligence, *GROSS domestic product, *JOB performance, *INDUSTRIAL productivity, ONLINE algorithms, SOCIAL values

Distributed asynchronous rendezvous planning on the line for multi-agent systems.

Autori: Ozsoyeller, Deniz¹ (AUTHOR) deniz.ozsoyeller@yasar.edu.tr, Özkasap, Öznur² (AUTHOR) oozkasap@ku.edu.tr

Fonte: Future Generation Computer Systems. Dec2024, Vol. 161, p35-48. 14p.

Soggetti: *SCALABILITY, *ROBOTS, ONLINE algorithms, MULTIAGENT systems, DISTRIBUTED algorithms

Distributed online primal-dual subgradient method on unbalanced directed networks.

Autori: Tada, Keishin¹ (AUTHOR), Hayashi, Naoki² (AUTHOR) n.hayashi@sys.es.osaka-u.ac.jp, Takai, Shigemasa¹ (AUTHOR)

Fonte: Advanced Robotics. May2024, Vol. 38 Issue 9/10, p591-602. 12p.

Soggetti: *SUBGRADIENT methods, *ONLINE algorithms, *COST functions, *TELECOMMUNICATION systems, *DIRECTED graphs, *DISTRIBUTED algorithms, *TIME-varying networks

Scheduling with a discounted profit criterion on identical machines.

Autori: Li, Weidong¹ (AUTHOR), Yang, Yaru¹ (AUTHOR), Xiao, Man¹ (AUTHOR), Chen, Xin^1,2 (AUTHOR) chenxin.lut@hotmail.com, Sterna, Małgorzata³ (AUTHOR), Błażewicz, Jacek^3,4,5 (AUTHOR)

Fonte: Discrete Applied Mathematics. May2025, Vol. 367, p195-209. 15p.

Soggetti: *APPROXIMATION algorithms, *ONLINE algorithms, *SCHEDULING, *GENERALIZATION, *ALGORITHMS, *MACHINERY

A Distributed Actor‐Critic Learning Approach for Affine Formation Control of Multi‐Robots With Unknown Dynamics.

Autori: Zhang, Ronghua^1,2 (AUTHOR), Ma, Qingwen¹ (AUTHOR), Zhang, Xinglong¹ (AUTHOR) zhangxinglong18@nudt.edu.cn, Xu, Xin¹ (AUTHOR) xinxu@nudt.edu.cn, Liu, Daxue¹ (AUTHOR)

Fonte: International Journal of Adaptive Control & Signal Processing. Apr2025, Vol. 39 Issue 4, p803-817. 15p.

Soggetti: *REINFORCEMENT learning, *ONLINE algorithms, *ONLINE education, *LOCAL mass media, *COMPUTER simulation

An online joint optimization approach for task offloading and caching in multi-access edge computing.

Autori: Yang, Xuemei^1,2 (AUTHOR) yangxuemei@aust.edu.cn, Luo, Hong² (AUTHOR) luoh@bupt.edu.cn, Sun, Yan² (AUTHOR) sunyan@bupt.edu.cn

Fonte: Wireless Networks (10220038). Mar2025, Vol. 31 Issue 3, p2637-2651. 15p.

Soggetti: *ARTIFICIAL intelligence, *ONLINE algorithms, *INFORMATION storage & retrieval systems, *WIRELESS channels, *EDGE computing

Online tile dispatching framework with guarantees for 360-degree video streaming in wireless networks.

Autori: Zhao, Yingjie¹ (AUTHOR) zhaoyj55@mail2.sysu.edu.cn, Cai, Kechao¹ (AUTHOR) caikch3@mail.sysu.edu.cn, Zhang, Jinbei¹ (AUTHOR) zhjinbei@mail.sysu.edu.cn, Chen, Zhuoyue¹ (AUTHOR) chenzhy225@mail2.sysu.edu.cn, Chen, Ziqun¹ (AUTHOR) chenzq35@mail2.sysu.edu.cn

Fonte: Wireless Networks (10220038). Mar2025, Vol. 31 Issue 3, p2091-2111. 21p.

Soggetti: *STREAMING video & television, *ONLINE algorithms, *TELECOMMUNICATION, *TRACKING algorithms, *CONSTRAINT satisfaction

Online Calibration Method of LiDAR and Camera Based on Fusion of Multi-Scale Cost Volume.

Autori: Han, Xiaobo¹ (AUTHOR), Luo, Jie^1,2 (AUTHOR), Wei, Xiaoxu^2,3 (AUTHOR), Wang, Yongsheng^1,3 (AUTHOR) wysh@whut.edu.cn

Fonte: Information (2078-2489). Mar2025, Vol. 16 Issue 3, p223. 16p.

Soggetti: *ONLINE algorithms, *CAMERA calibration, *MULTISENSOR data fusion, *POINT cloud, *LIDAR

Integrated scheduling of order picking operations under dynamic order arrivals.

Autori: D'Haen, Ruben^1,2, Braekers, Kris¹, Ramaekers, Katrien¹

Fonte: International Journal of Production Research. May2023, Vol. 61 Issue 10, p3205-3226. 22p.

Soggetti: *DATABASE design, *CUSTOMER satisfaction, *SEARCH algorithms, *PRODUCTION scheduling, *SCHEDULING, ONLINE algorithms, EXPERIMENTAL design

Neural networks as an approximator for a family of optimization algorithm solutions for online applications.

Autori: López-Rojas, Arturo D.¹ (AUTHOR) desaix.rojas@cinvestav.mx, Cruz-Villar, Carlos A.¹ (AUTHOR)

Fonte: Neural Computing & Applications. Feb2024, Vol. 36 Issue 6, p3125-3140. 16p.

Soggetti: *OPTIMIZATION algorithms, *ONLINE algorithms, *INVERSE functions, *PROBLEM solving, *PREDICTION models, *PARAMETER estimation, *FIRST-order logic