Статті в журналах з теми "Competitive online algorithms"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Competitive online algorithms".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Wu, Yonghua, Guohun Zhu, Huaying Chen, and Jucun Qin. "WIN Algorithm for Discrete Online TSP." Journal of Advanced Computational Intelligence and Intelligent Informatics 15, no. 9 (November 20, 2011): 1199–202. http://dx.doi.org/10.20965/jaciii.2011.p1199.
Повний текст джерелаZHANG, YONG, YUXIN WANG, FRANCIS Y. L. CHIN, and HING-FUNG TING. "COMPETITIVE ALGORITHMS FOR ONLINE PRICING." Discrete Mathematics, Algorithms and Applications 04, no. 02 (June 2012): 1250015. http://dx.doi.org/10.1142/s1793830912500152.
Повний текст джерелаKumar, Sandeep, and Deepak Garg. "Online Financial Algorithms: Competitive Analysis." International Journal of Computer Applications 40, no. 7 (February 29, 2012): 8–14. http://dx.doi.org/10.5120/4974-7228.
Повний текст джерелаAshlagi, Itai, Brendan Lucier, and Moshe Tennenholtz. "Equilibria of Online Scheduling Algorithms." Proceedings of the AAAI Conference on Artificial Intelligence 27, no. 1 (June 30, 2013): 67–73. http://dx.doi.org/10.1609/aaai.v27i1.8631.
Повний текст джерелаHopf, Michael, Clemens Thielen, and Oliver Wendt. "Competitive algorithms for multistage online scheduling." European Journal of Operational Research 260, no. 2 (July 2017): 468–81. http://dx.doi.org/10.1016/j.ejor.2016.12.047.
Повний текст джерелаYang, Lin, Ali Zeynali, Mohammad H. Hajiesmaili, Ramesh K. Sitaraman, and Don Towsley. "Competitive Algorithms for Online Multidimensional Knapsack Problems." Proceedings of the ACM on Measurement and Analysis of Computing Systems 5, no. 3 (December 14, 2021): 1–30. http://dx.doi.org/10.1145/3491042.
Повний текст джерелаLee, Russell, Jessica Maghakian, Mohammad Hajiesmaili, Jian Li, Ramesh Sitaraman, and Zhenhua Liu. "Online peak-aware energy scheduling with untrusted advice." ACM SIGEnergy Energy Informatics Review 1, no. 1 (November 2021): 59–77. http://dx.doi.org/10.1145/3508467.3508473.
Повний текст джерелаXu, Chenyang, and Benjamin Moseley. "Learning-Augmented Algorithms for Online Steiner Tree." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 8 (June 28, 2022): 8744–52. http://dx.doi.org/10.1609/aaai.v36i8.20854.
Повний текст джерелаMa, Hang. "A Competitive Analysis of Online Multi-Agent Path Finding." Proceedings of the International Conference on Automated Planning and Scheduling 31 (May 17, 2021): 234–42. http://dx.doi.org/10.1609/icaps.v31i1.15967.
Повний текст джерелаYang, Lin, Ali Zeynali, Mohammad H. Hajiesmaili, Ramesh K. Sitaraman, and Don Towsley. "Competitive Algorithms for Online Multidimensional Knapsack Problems." ACM SIGMETRICS Performance Evaluation Review 50, no. 1 (June 20, 2022): 87–88. http://dx.doi.org/10.1145/3547353.3522627.
Повний текст джерелаChen, Lin, Deshi Ye, and Guochuan Zhang. "Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming." Asia-Pacific Journal of Operational Research 32, no. 01 (February 2015): 1540011. http://dx.doi.org/10.1142/s0217595915400114.
Повний текст джерелаBOSE, PROSENJIT, ANDREJ BRODNIK, SVANTE CARLSSON, ERIK D. DEMAINE, RUDOLF FLEISCHER, ALEJANDRO LÓPEZ-ORTIZ, PAT MORIN, and J. IAN MUNRO. "ONLINE ROUTING IN CONVEX SUBDIVISIONS." International Journal of Computational Geometry & Applications 12, no. 04 (August 2002): 283–95. http://dx.doi.org/10.1142/s021819590200089x.
Повний текст джерелаLikas, Aristidis. "A Reinforcement Learning Approach to Online Clustering." Neural Computation 11, no. 8 (November 1, 1999): 1915–32. http://dx.doi.org/10.1162/089976699300016025.
Повний текст джерелаBuchbinder, Niv, Shahar Chen, Joseph (Seffi) Naor, and Ohad Shamir. "Unified Algorithms for Online Learning and Competitive Analysis." Mathematics of Operations Research 41, no. 2 (May 2016): 612–25. http://dx.doi.org/10.1287/moor.2015.0742.
Повний текст джерелаHE, YONG, SHUGUANG HAN, and YIWEI JIANG. "ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST." Asia-Pacific Journal of Operational Research 24, no. 02 (April 2007): 263–77. http://dx.doi.org/10.1142/s0217595907001231.
Повний текст джерелаBarrière, Lali, Xavier Muñoz, Janosch Fuchs, and Walter Unger. "Online Matching in Regular Bipartite Graphs." Parallel Processing Letters 28, no. 02 (June 2018): 1850008. http://dx.doi.org/10.1142/s0129626418500081.
Повний текст джерелаDu, Bingqian, Zhiyi Huang, and Chuan Wu. "Adversarial Deep Learning for Online Resource Allocation." ACM Transactions on Modeling and Performance Evaluation of Computing Systems 6, no. 4 (December 31, 2021): 1–25. http://dx.doi.org/10.1145/3494526.
Повний текст джерелаDwibedy, Debasis, and Rakesh Mohanty. "Online List Scheduling for Makespan Minimization." ACM SIGACT News 53, no. 2 (June 10, 2022): 84–105. http://dx.doi.org/10.1145/3544979.3544993.
Повний текст джерелаGoyal, Shashank, and Diwakar Gupta. "The Online Reservation Problem." Algorithms 13, no. 10 (September 23, 2020): 241. http://dx.doi.org/10.3390/a13100241.
Повний текст джерелаFUNG, STANLEY P. Y., FRANCIS Y. L. CHIN, and HONG SHEN. "ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO." International Journal of Foundations of Computer Science 16, no. 03 (June 2005): 581–98. http://dx.doi.org/10.1142/s0129054105003170.
Повний текст джерелаLin, Qiulin, Yanfang Mo, Junyan Su, and Minghua Chen. "Competitive Online Optimization with Multiple Inventories." ACM SIGMETRICS Performance Evaluation Review 50, no. 1 (June 20, 2022): 83–84. http://dx.doi.org/10.1145/3547353.3530969.
Повний текст джерелаZhou, Hao, Ping Zhou, and Yiwei Jiang. "Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines." Asia-Pacific Journal of Operational Research 32, no. 05 (October 2015): 1550034. http://dx.doi.org/10.1142/s0217595915500347.
Повний текст джерелаLi, Wenjie, and Jinjiang Yuan. "An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead." Asia-Pacific Journal of Operational Research 32, no. 06 (December 2015): 1550047. http://dx.doi.org/10.1142/s0217595915500475.
Повний текст джерелаLykouris, Thodoris, and Sergei Vassilvitskii. "Competitive Caching with Machine Learned Advice." Journal of the ACM 68, no. 4 (July 7, 2021): 1–25. http://dx.doi.org/10.1145/3447579.
Повний текст джерелаMa, Weimin, and Xiaodong Ji. "Online Work-Break Problem and its Competitive Analysis." Asia-Pacific Journal of Operational Research 33, no. 02 (April 2016): 1650011. http://dx.doi.org/10.1142/s0217595916500111.
Повний текст джерелаBurjons, Elisabet, Juraj Hromkovič, Rastislav Královič, Richard Královič, Xavier Muñoz, and Walter Unger. "Online Graph Coloring Against a Randomized Adversary." International Journal of Foundations of Computer Science 29, no. 04 (June 2018): 551–69. http://dx.doi.org/10.1142/s0129054118410058.
Повний текст джерелаHoeller, Frank. "LEO: Liquid Exploration Online." International Journal of Robotic Computing 2, no. 1 (April 1, 2020): 58–80. http://dx.doi.org/10.35708/rc1869-126259.
Повний текст джерелаChai, Xing, Lingfa Lu, Wenhua Li, and Liqi Zhang. "Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time." Asia-Pacific Journal of Operational Research 35, no. 06 (December 2018): 1850048. http://dx.doi.org/10.1142/s0217595918500483.
Повний текст джерелаvan Stee, Rob. "SIGACT News Online Algorithms Column 37." ACM SIGACT News 52, no. 2 (June 14, 2021): 71. http://dx.doi.org/10.1145/3471469.3471480.
Повний текст джерелаFotakis, Dimitris, Loukas Kavouras, and Lydia Zakynthinou. "Online Facility Location in Evolving Metrics." Algorithms 14, no. 3 (February 25, 2021): 73. http://dx.doi.org/10.3390/a14030073.
Повний текст джерелаAlbers, Susanne, Arindam Khan, and Leon Ladewig. "Improved Online Algorithms for Knapsack and GAP in the Random Order Model." Algorithmica 83, no. 6 (February 17, 2021): 1750–85. http://dx.doi.org/10.1007/s00453-021-00801-2.
Повний текст джерелаMa, Hang. "Extended Abstract: A Competitive Analysis of Online Multi-Agent Path Finding." Proceedings of the International Symposium on Combinatorial Search 12, no. 1 (July 21, 2021): 182–84. http://dx.doi.org/10.1609/socs.v12i1.18577.
Повний текст джерелаQin, Tiancheng, and S. Rasoul Etesami. "Optimal Online Algorithms for File-Bundle Caching and Generalization to Distributed Caching." ACM Transactions on Modeling and Performance Evaluation of Computing Systems 6, no. 1 (June 2021): 1–23. http://dx.doi.org/10.1145/3445028.
Повний текст джерелаZeynali, Ali, Bo Sun, Mohammad Hajiesmaili, and Adam Wierman. "Data-driven Competitive Algorithms for Online Knapsack and Set Cover." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 12 (May 18, 2021): 10833–41. http://dx.doi.org/10.1609/aaai.v35i12.17294.
Повний текст джерелаKhadiev, Kamil, and Aliya Khadieva. "Quantum and Classical Log-Bounded Automata for the Online Disjointness Problem." Mathematics 10, no. 1 (January 4, 2022): 143. http://dx.doi.org/10.3390/math10010143.
Повний текст джерелаJanuszewski, Janusz, and Łukasz Zielonka. "Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing." International Journal of Foundations of Computer Science 27, no. 04 (June 2016): 407–29. http://dx.doi.org/10.1142/s0129054116500076.
Повний текст джерелаZhao, Tianming, Wei Li, and Albert Y. Zomaya. "Uniform Machine Scheduling with Predictions." Proceedings of the International Conference on Automated Planning and Scheduling 32 (June 13, 2022): 413–22. http://dx.doi.org/10.1609/icaps.v32i1.19827.
Повний текст джерелаAssadi, Sepehr, Justin Hsu, and Shahin Jabbari. "Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets." Proceedings of the AAAI Conference on Human Computation and Crowdsourcing 3 (September 23, 2015): 12–21. http://dx.doi.org/10.1609/hcomp.v3i1.13236.
Повний текст джерелаChin, Francis Y. L., and Stanley P. Y. Fung. "Improved competitive algorithms for online scheduling with partial job values." Theoretical Computer Science 325, no. 3 (October 2004): 467–78. http://dx.doi.org/10.1016/j.tcs.2004.02.046.
Повний текст джерелаChin, Francis Y. L., Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Jiří Sgall, and Tomáš Tichý. "Online competitive algorithms for maximizing weighted throughput of unit jobs." Journal of Discrete Algorithms 4, no. 2 (June 2006): 255–76. http://dx.doi.org/10.1016/j.jda.2005.03.005.
Повний текст джерелаSun, Bo, Ali Zeynali, Tongxin Li, Mohammad Hajiesmaili, Adam Wierman, and Danny H. K. Tsang. "Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging." ACM SIGMETRICS Performance Evaluation Review 49, no. 1 (June 22, 2022): 67–68. http://dx.doi.org/10.1145/3543516.3456271.
Повний текст джерелаChen, Weirong, Jiaqi Zheng, Haoyu Yu, Guihai Chen, Yixin Chen, and Dongsheng Li. "Online Learning Bipartite Matching with Non-stationary Distributions." ACM Transactions on Knowledge Discovery from Data 16, no. 5 (October 31, 2022): 1–22. http://dx.doi.org/10.1145/3502734.
Повний текст джерелаGao, Qiang, Ganggang Li, and Xiwen Lu. "Online and semi-online scheduling to minimize makespan on single machine with an availability constraint." Discrete Mathematics, Algorithms and Applications 07, no. 03 (September 2015): 1550021. http://dx.doi.org/10.1142/s1793830915500214.
Повний текст джерелаJarsulic, Marc. "Addressing the Competitive Harms of Opaque Online Surveillance and Recommendation Algorithms." Antitrust Bulletin 67, no. 1 (January 19, 2022): 100–112. http://dx.doi.org/10.1177/0003603x211066983.
Повний текст джерелаJIANG, YIWEI, AN ZHANG, and JUELIANG HU. "OPTIMAL ONLINE ALGORITHMS ON TWO HIERARCHICAL MACHINES WITH RESOURCE AUGMENTATION." Discrete Mathematics, Algorithms and Applications 04, no. 01 (March 2012): 1250012. http://dx.doi.org/10.1142/s1793830912500127.
Повний текст джерелаSun, Bo, Lin Yang, Mohammad Hajiesmaili, Adam Wierman, John C. S. Lui, Don Towsley, and Danny H. K. Tsang. "The Online Knapsack Problem with Departures." Proceedings of the ACM on Measurement and Analysis of Computing Systems 6, no. 3 (December 2022): 1–32. http://dx.doi.org/10.1145/3570618.
Повний текст джерелаBuchbinder, Niv, and Joseph (Seffi) Naor. "The Design of Competitive Online Algorithms via a Primal—Dual Approach." Foundations and Trends® in Theoretical Computer Science 3, no. 2–3 (2009): 93–263. http://dx.doi.org/10.1561/0400000024.
Повний текст джерелаBuchbinder, Niv, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, and Maxim Sviridenko. "Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms." Operations Research 61, no. 4 (August 2013): 1014–29. http://dx.doi.org/10.1287/opre.2013.1188.
Повний текст джерелаEghbali, Reza, James Saunderson, and Maryam Fazel. "Competitive online algorithms for resource allocation over the positive semidefinite cone." Mathematical Programming 170, no. 1 (June 12, 2018): 267–92. http://dx.doi.org/10.1007/s10107-018-1305-1.
Повний текст джерелаBachrach, El-Yaniv, and Reinstädtler. "On the Competitive Theory and Practice of Online List Accessing Algorithms." Algorithmica 32, no. 2 (February 2002): 201–45. http://dx.doi.org/10.1007/s00453-001-0069-8.
Повний текст джерела