Energy efficient dynamic offloading in mobile edge computing for internet of things

Y Chen, N Zhang, Y Zhang, X Chen… - IEEE Transactions on …, 2019‏ - ieeexplore.ieee.org
With proliferation of computation-intensive Internet of Things (IoT) applications, the limited
capacity of end devices can deteriorate service performance. To address this issue …

Optimal schedule of mobile edge computing for internet of things using partial information

X Lyu, W Ni, H Tian, RP Liu, X Wang… - IEEE Journal on …, 2017‏ - ieeexplore.ieee.org
Mobile edge computing is of particular interest to Internet of Things (IoT), where inexpensive
simple devices can get complex tasks offloaded to and processed at powerful infrastructure …

Diet code is healthy: Simplifying programs for pre-trained models of code

Z Zhang, H Zhang, B Shen, X Gu - Proceedings of the 30th ACM Joint …, 2022‏ - dl.acm.org
Pre-trained code representation models such as CodeBERT have demonstrated superior
performance in a variety of software engineering tasks, yet they are often heavy in …

Combining global optimization with local selection for efficient QoS-aware service composition

M Alrifai, T Risse - Proceedings of the 18th international conference on …, 2009‏ - dl.acm.org
The run-time binding of web services has been recently put forward in order to support rapid
and dynamic web service compositions. With the growing number of alternative web …

A hybrid approach for efficient Web service composition with end-to-end QoS constraints

M Alrifai, T Risse, W Nejdl - ACM Transactions on the Web (TWEB), 2012‏ - dl.acm.org
Dynamic selection of Web services at runtime is important for building flexible and loosely-
coupled service-oriented applications. An abstract description of the required services is …

AoI-aware user service satisfaction enhancement in digital twin-empowered edge computing

J Li, S Guo, W Liang, J Wang, Q Chen… - … /ACM Transactions on …, 2023‏ - ieeexplore.ieee.org
The emerging digital twin technique enhances the network management efficiency and
provides comprehensive insights on network performance, through map** physical …

A minimal algorithm for the 0-1 knapsack problem

D Pisinger - Operations Research, 1997‏ - pubsonline.informs.org
Several types of large-sized 0-1 Knapsack Problems (KP) may be easily solved, but in such
cases most of the computational effort is used for sorting and reduction. In order to avoid this …

Digital twin-enabled service satisfaction enhancement in edge computing

J Li, J Wang, Q Chen, Y Li… - IEEE INFOCOM 2023 …, 2023‏ - ieeexplore.ieee.org
The emerging digital twin technique enhances the network management efficiency and
provides comprehensive insights, through map** physical objects to their digital twins …

Linear time algorithms for knapsack problems with bounded weights

D Pisinger - Journal of Algorithms, 1999‏ - Elsevier
A new technique called balancing is presented for the solution of Knapsack Problems. It is
proved that an optimal solution to the Knapsack Problem is balanced, and thus only …

Budget-aware user satisfaction maximization on service provisioning in mobile edge computing

J Li, W Liang, W Xu, Z Xu, X Jia… - IEEE Transactions on …, 2022‏ - ieeexplore.ieee.org
Mobile Edge Computing (MEC) promises to provide mobile users with delay-sensitive
services at the edge of network, and each user service request usually is associated with a …