Výsledky vyhledávání - Approximation algorithms and online algorithms

Upřesnit hledání
  1. 1

    Approximation and online algorithms for multidimensional bin packing: A survey Autor Christensen, Henrik I., Khan, Arindam, Pokutta, Sebastian, Tetali, Prasad

    ISSN: 1574-0137, 1876-7745
    Vydáno: Elsevier Inc 01.05.2017
    Vydáno v Computer science review (01.05.2017)
    “… In this survey we consider approximation and online algorithms for several classical generalizations of bin packing problem such as geometric bin packing, vector bin packing…”
    Získat plný text
    Journal Article
  2. 2

    Approximation Algorithms for Online User Association in Multi-Tier Multi-Cell Mobile Networks Autor Weng Chon Ao, Psounis, Konstantinos

    ISSN: 1063-6692, 1558-2566
    Vydáno: New York IEEE 01.08.2017
    Vydáno v IEEE/ACM transactions on networking (01.08.2017)
    “… potentially inducing a large number of re-associations for previously arrived users. On the other hand, practical online algorithms that do not allow any such user re…”
    Získat plný text
    Journal Article
  3. 3

    Approximation and Online Algorithms for NFV-Enabled Multicasting in SDNs Autor Zichuan Xu, Weifa Liang, Meitian Huang, Mike Jia, Song Guo, Galis, Alex

    ISSN: 1063-6927
    Vydáno: IEEE 01.06.2017
    “…Multicasting is a fundamental functionality of networks for many applications including online conferencing, event monitoring, video streaming, and system monitoring in data centers…”
    Získat plný text
    Konferenční příspěvek
  4. 4

    Special Issue on Approximation and Online Algorithms Autor Epstein, Leah, Erlebach, Thomas

    ISSN: 1432-4350, 1433-0490
    Vydáno: New York Springer US 01.05.2020
    Vydáno v Theory of computing systems (01.05.2020)
    Získat plný text
    Journal Article
  5. 5

    Approximation algorithms for stochastic online matching with reusable resources Autor Shanks, Meghan, Yu, Ge, Jacobson, Sheldon H.

    ISSN: 1432-2994, 1432-5217
    Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2023
    “… We provide constant approximation algorithms for different variations of this problem with equal-length jobs…”
    Získat plný text
    Journal Article
  6. 6

    Correction to: Special Issue on Approximation and Online Algorithms Autor Epstein, Leah, Erlebach, Thomas

    ISSN: 1432-4350, 1433-0490
    Vydáno: New York Springer US 01.05.2020
    Vydáno v Theory of computing systems (01.05.2020)
    “…The original version of the article was inadvertently published with misinterpretations on author’s proof corrections on mathematical expressions…”
    Získat plný text
    Journal Article
  7. 7
  8. 8

    Dynamic Service Placement for Mobile Micro-Clouds with Predicted Future Costs Autor Wang, Shiqiang, Urgaonkar, Rahul, He, Ting, Chan, Kevin, Zafer, Murtaza, Leung, Kin K.

    ISSN: 1045-9219, 1558-2183
    Vydáno: New York IEEE 01.04.2017
    “… Then, we propose an online approximation algorithm with polynomial time-complexity to find the placement in real-time whenever an instance arrives…”
    Získat plný text
    Journal Article
  9. 9

    An Online Actor–Critic Algorithm with Function Approximation for Constrained Markov Decision Processes Autor Bhatnagar, Shalabh, Lakshmanan, K.

    ISSN: 0022-3239, 1573-2878
    Vydáno: Boston Springer US 01.06.2012
    “…We develop an online actor–critic reinforcement learning algorithm with function approximation for a problem of control under inequality constraints…”
    Získat plný text
    Journal Article
  10. 10

    LBBA: An efficient online benefit-aware multiprocessor scheduling for QoS via online choice of approximation algorithms Autor Sanati, Behnaz, Cheng, Albert M.K.

    ISSN: 0167-739X, 1872-7115
    Vydáno: Elsevier B.V 01.06.2016
    Vydáno v Future generation computer systems (01.06.2016)
    “… We propose an online choice of two approximation algorithms in order to partition the jobs among identical processors at the time of their arrival without using any statistics…”
    Získat plný text
    Journal Article
  11. 11
  12. 12

    Efficient approximation algorithms for offline and online unit disk multiple coverage Autor Gao, Xuening, Guo, Longkun, Liao, Kewen

    ISSN: 0045-7906, 1879-0755
    Vydáno: Elsevier Ltd 01.12.2022
    Vydáno v Computers & electrical engineering (01.12.2022)
    “…Multiple coverage with unit disks is a problem widely seen in monitoring applications of wireless sensor networks. In this problem, let T=t1,t2,…,tn be a set…”
    Získat plný text
    Journal Article
  13. 13

    AoI-Aware User Service Satisfaction Enhancement in Digital Twin-Empowered Edge Computing Autor Li, Jing, Guo, Song, Liang, Weifa, Wang, Jianping, Chen, Quan, Xu, Zichuan, Xu, Wenzheng

    ISSN: 1063-6692, 1558-2566
    Vydáno: New York IEEE 01.04.2024
    Vydáno v IEEE/ACM transactions on networking (01.04.2024)
    “…The emerging digital twin technique enhances the network management efficiency and provides comprehensive insights on network performance, through mapping…”
    Získat plný text
    Journal Article
  14. 14

    Online Placement of Multi-Component Applications in Edge Computing Environments Autor Shiqiang Wang, Zafer, Murtaza, Leung, Kin K.

    ISSN: 2169-3536, 2169-3536
    Vydáno: Piscataway IEEE 2017
    Vydáno v IEEE access (2017)
    “… hard, and therefore, heuristic algorithms without performance guarantees are generally employed in common practice…”
    Získat plný text
    Journal Article
  15. 15

    Special Issue on Approximation and Online Algorithms Autor Solis-Oba, Roberto, Persiano, Giuseppe

    ISSN: 1432-4350, 1433-0490
    Vydáno: Boston Springer US 01.01.2015
    Vydáno v Theory of computing systems (01.01.2015)
    “…Issue Title: Approximation and Online Algorithms…”
    Získat plný text
    Journal Article
  16. 16

    Special Issue on Approximation and Online Algorithms Autor Erlebach, Thomas, Persiano, Giuseppe

    ISSN: 1432-4350, 1433-0490
    Vydáno: Boston Springer US 01.01.2015
    Vydáno v Theory of computing systems (01.01.2015)
    “…Issue Title: Approximation and Online Algorithms…”
    Získat plný text
    Journal Article
  17. 17
  18. 18

    Approximation Results for Makespan Minimization with Budgeted Uncertainty Autor Bougeret, Marin, Jansen, Klaus, Poss, Michael, Rohwedder, Lars

    ISSN: 1432-4350, 1433-0490
    Vydáno: New York Springer US 01.08.2021
    Vydáno v Theory of computing systems (01.08.2021)
    “…We study approximation algorithms for the problem of minimizing the makespan on a set of machines with uncertainty on the processing times of jobs…”
    Získat plný text
    Journal Article
  19. 19

    Energy-Aware Inference Offloading for DNN-Driven Applications in Mobile Edge Clouds Autor Xu, Zichuan, Zhao, Liqian, Liang, Weifa, Rana, Omer F., Zhou, Pan, Xia, Qiufen, Xu, Wenzheng, Wu, Guowei

    ISSN: 1045-9219, 1558-2183
    Vydáno: New York IEEE 01.04.2021
    “…With increasing focus on Artificial Intelligence (AI) applications, Deep Neural Networks (DNNs) have been successfully used in a number of application areas…”
    Získat plný text
    Journal Article
  20. 20

    Online Problems and Approximation Algorithms Autor Xian, Jiayi

    ISBN: 9798371991058
    Vydáno: ProQuest Dissertations & Theses 01.01.2023
    “… We recognize the significance of classical techniques in developing algorithms for NP-hard problems, while also acknowledging the recent advancements in machine learning algorithms that provide new…”
    Získat plný text
    Dissertation