Results 221 to 230 of about 89,468 (247)
Some of the next articles are maybe not open access.
Budgeted video replacement policy in mobile crowdsensing
J. Parallel Distributed Comput., 2020Mobile crowdsensing offers a new platform that recruits a suitable set of users to collectively complete an information collection/sensing task through users’ equipped devices.
E. Wang +5 more
semanticscholar +1 more source
Budgeted Maximum Graph Coverage
2002An instance of the maximum coverage problem is given by a set of weighted ground elements and a cost weighted family of subsets of the ground element set. The goal is to select a subfamily of total cost of at most that of a given budget maximizing the weight of the covered elements.We formulate the problem on graphs: In this situation the set of ground
Sven Oliver Krumke +4 more
openaire +1 more source
Charging on the Move: Scheduling Static Chargers with Tunable Power for Mobile Devices
International Workshop on Quality of Service, 2021The breakthrough of Wireless Power Transfer (WPT) technique provides a promising paradigm to tackle the energy limitation problem for end-devices when replenishing energy wirelessly without the need of replacing battery.
Tao Wu, Panlong Yang, Haipeng Dai
semanticscholar +1 more source
Maximum Coverage Problem with Group Budget Constraints and Applications
2004We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets \({\cal S} = \{S_1, S_2, \ldots, S_m\}\) where each set S i is a subset of a given ground set X.
Chandra Chekuri, Amit Kumar 0001
openaire +1 more source
Approximation algorithms for profit maximisation in multicast D2D networks
International Journal of Ad Hoc and Ubiquitous Computing, 2021As the demand for mobile data services increases, telecom companies need to develop wise strategies to retain existing customers. For instance, in a multicast scenario, satisfying individual user's quality of service (QoS), data demand at varying rates ...
J. R. Bhat +3 more
semanticscholar +1 more source
Wireless Networks, 2016
Mobile crowd sensing has become an effective approach to meet the demand in large scale sensing applications. In mobile crowd sensing applications, incentive mechanisms are necessary to compensate the resource consumptions and manual efforts of smartphone users.
Jia Xu 0003, Jinxin Xiang, Yanxu Li
openaire +1 more source
Mobile crowd sensing has become an effective approach to meet the demand in large scale sensing applications. In mobile crowd sensing applications, incentive mechanisms are necessary to compensate the resource consumptions and manual efforts of smartphone users.
Jia Xu 0003, Jinxin Xiang, Yanxu Li
openaire +1 more source
Approximation Algorithms for Maximum Coverage with Group Budget Constraints
2017In this paper, we study the maximum coverage problem with group budget constraints (MCG) that generalizes the maximum coverage problem. Given a ground set U in which \(i\in U\) has a non-negative weight \(w_{i}\), a positive integer k and a collection of sets \(\mathcal{S}\), the maximum coverage problem is to pick k sets of \(\mathcal{S}\) to maximize
Longkun Guo, Min Li 0028, Dachuan Xu
openaire +1 more source
Generalized Budgeted Submodular Set Function Maximization
International Symposium on Mathematical Foundations of Computer Science, 2018In this paper we consider a generalization of the well-known budgeted maximum coverage problem. We are given a ground set of elements and a set of bins. The goal is to find a subset of elements along with an associated set of bins, such that the overall ...
Francesco Cellinese +3 more
semanticscholar +1 more source
A Constant-Factor Approximation Algorithm for Online Coverage Path Planning with Energy Constraint
IEEE International Conference on Healthcare Informatics, 2019In this paper, we study the problem of coverage planning by a mobile robot with a limited energy budget. The objective of the robot is to cover every point in the environment while minimizing the traveled path length. The environment is initially unknown
Ayan Dutta, Gokarna Sharma
semanticscholar +1 more source
Maximum Weighted Independent Sets with a Budget
International Conference on Algorithms and Discrete Applied Mathematics, 2015Given a graph $G$, a non-negative integer $k$, and a weight function that maps each vertex in $G$ to a positive real number, the \emph{Maximum Weighted Budgeted Independent Set (MWBIS) problem} is about finding a maximum weighted independent set in $G ...
Tushar Kalra +3 more
semanticscholar +1 more source