Fair: Quality-aware federated learning with precise user incentive and model aggregation
Federated learning enables distributed learning in a privacy-protected manner, but two
challenging reasons can affect learning performance significantly. First, mobile users are not …
challenging reasons can affect learning performance significantly. First, mobile users are not …
A polynomial time approximation scheme for the multiple knapsack problem
The multiple knapsack problem (MKP) is a natural and well-known generalization of the
single knapsack problem and is defined as follows. We are given a set of n items and m bins …
single knapsack problem and is defined as follows. We are given a set of n items and m bins …
Routing in socially selfish delay tolerant networks
Existing routing algorithms for Delay Tolerant Networks (DTNs) assume that nodes are
willing to forward packets for others. In the real world, however, most people are socially …
willing to forward packets for others. In the real world, however, most people are socially …
Improving federated learning with quality-aware user incentive and auto-weighted model aggregation
Federated learning enables distributed model training over various computing nodes, eg,
mobile devices, where instead of sharing raw user data, computing nodes can solely commit …
mobile devices, where instead of sharing raw user data, computing nodes can solely commit …
An efficient approximation for the generalized assignment problem
We present a simple family of algorithms for solving the Generalized Assignment Problem
(GAP). Our technique is based on a novel combinatorial translation of any algorithm for the …
(GAP). Our technique is based on a novel combinatorial translation of any algorithm for the …
An improved fruit fly optimization algorithm for solving the multidimensional knapsack problem
T Meng, QK Pan - Applied Soft Computing, 2017 - Elsevier
This paper presents an improved fruit fly optimization algorithm (IFFOA) for solving the
multidimensional knapsack problem (MKP). In IFFOA, the parallel search is employed to …
multidimensional knapsack problem (MKP). In IFFOA, the parallel search is employed to …
Extending delivery range and decelerating battery aging of logistics UAVs using public buses
The battery-powered Unmanned Aerial Vehicle (UAV) is a promising alternative to
traditional logistics trucks. Using UAVs can achieve much more speedy, cost-effective, and …
traditional logistics trucks. Using UAVs can achieve much more speedy, cost-effective, and …
Multi-user computation offloading as multiple knapsack problem for 5G mobile edge computing
We present an overview of NP-hard problems and methods related to deployment, resource
sharing, load balancing and fairness among multiple users in 5G mobile networks. We …
sharing, load balancing and fairness among multiple users in 5G mobile networks. We …
Reward-oriented task offloading under limited edge server power for multiaccess edge computing
M Song, Y Lee, K Kim - IEEE Internet of Things Journal, 2021 - ieeexplore.ieee.org
In multiaccess edge computing (MEC), tasks are offloaded from mobile devices to servers at
the edge of the network. This speeds up task processing without incurring the latency …
the edge of the network. This speeds up task processing without incurring the latency …
[PDF][PDF] Revisiting the greedy approach to submodular set function maximization
We consider the problem of maximizing a nondecreasing submodular set function over
various constraint structures. Specifically, we explore the performance of the greedy …
various constraint structures. Specifically, we explore the performance of the greedy …