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

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

“…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

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

“…The emerging digital twin technique enhances the network management efficiency and provides comprehensive insights on network performance, through mapping…”
Získat plný text

Age-Aware Data Selection and Aggregator Placement for Timely Federated Continual Learning in Mobile Edge Computing Autor Xu, Zichuan, Wang, Lin, Liang, Weifa, Xia, Qiufen, Xu, Wenzheng, Zhou, Pan, Rana, Omer F.

“…Federated continual learning (FCL) is emerging as a key technology for time-sensitive applications in highly adaptive environments including autonomous driving…”
Získat plný text

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

“…We study approximation algorithms for the problem of minimizing the makespan on a set of machines with uncertainty on the processing times of jobs. In the…”
Získat plný text

Managing Multiple Mobile Resources Autor Feldkord, Björn, Knollmann, Till, Malatyali, Manuel, Heide, Friedhelm Meyer auf der

“…We extend the Mobile Server problem introduced in Feldkord and Meyer auf der Heide (TOPC 6 (3), 14:1–14:17 2019 ) to a model where k identical mobile…”
Získat plný text

Affinity-Aware VNF Placement in Mobile Edge Clouds via Leveraging GPUs Autor Xu, Zichuan, Zhang, Zhiheng, Lui, John C. S., Liang, Weifa, Xia, Qiufen, Zhou, Pan, Xu, Wenzheng, Wu, Guowei

“…Mobile edge computing becomes a promising technology to mitigate the latency of various cloud services. In addition, network function virtualization (NFV) has…”
Získat plný text

Preface Autor Bampis, Evripidis, Megow, Nicole

Získat plný text

Deterministic Min-Cost Matching with Delays Autor Azar, Yossi, Jacob Fanani, Amit

“…We consider the online Minimum-Cost Perfect Matching with Delays (MPMD) problem introduced by Emek et al. (STOC 2016), in which a general metric space is…”
Získat plný text

Streaming Algorithms for Bin Packing and Vector Scheduling Autor Cormode, Graham, Veselý, Pavel

“…Problems involving the efficient arrangement of simple objects, as captured by bin packing and makespan scheduling, are fundamental tasks in combinatorial…”
Získat plný text

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

“…Multicasting is a fundamental functionality of networks for many applications including online conferencing, event monitoring, video streaming, and system…”
Získat plný text

Advice Complexity of Priority Algorithms Autor Borodin, Allan, Boyar, Joan, Larsen, Kim S., Pankratov, Denis

“…The priority model of “greedy-like” algorithms was introduced by Borodin, Nielsen, and Rackoff in 2002. We augment this model by allowing priority algorithms…”
Získat plný text

Lower Bounds for Several Online Variants of Bin Packing Autor Balogh, János, Békési, József, Dósa, György, Epstein, Leah, Levin, Asaf

“…We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them…”
Získat plný text

On the Cycle Augmentation Problem: Hardness and Approximation Algorithms Autor Gálvez, Waldo, Grandoni, Fabrizio, Jabal Ameli, Afrouz, Sornat, Krzysztof

“…In the k -Connectivity Augmentation Problem we are given a k -edge-connected graph and a set of additional edges called links . Our goal is to find a set of…”
Získat plný text

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

Získat plný text

Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs Autor Liu, Fu-Hong, Liu, Hsiang-Hsuan, Wong, Prudence W. H.

“…We study online scheduling of unit-sized jobs in two related problems, namely, restricted assignment problem and smart grid problem. The input to the two…”
Získat plný text

Guest Editorial: Special Issue on Approximation and Online Algorithms Autor Solis-Oba, Roberto, Fleischer, Rudolf

Získat plný text

An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals Autor Chang, Minjun, Hochbaum, Dorit S., Spaen, Quico, Velednitsky, Mark

“…We present an optimally-competitive algorithm for the problem of maximum online perfect bipartite matching with i.i.d. arrivals. In this problem, we are given…”
Získat plný text

Digital Twin-Enabled Service Satisfaction Enhancement in Edge Computing Autor Li, Jing, Wang, Jianping, Chen, Quan, Li, Yuchen, Zomaya, Albert Y.

“…The emerging digital twin technique enhances the network management efficiency and provides comprehensive insights, through mapping physical objects to their…”
Získat plný text

Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs Autor Laish, Itay, Mozes, Shay

“…Let G be a graph where each vertex is associated with a label. A vertex-labeled approximate distance oracle is a data structure that, given a vertex v and a…”
Získat plný text

On Conceptually Simple Algorithms for Variants of Online Bipartite Matching Autor Borodin, Allan, Pankratov, Denis, Salehi-Abari, Amirali

“…We present a series of results regarding conceptually simple algorithms for bipartite matching in various online and related models. We first consider a…”
Získat plný text