27 citations · 64 across the 8 of their papers we have counts for
8 papers
Analysis of Busy-Time Scheduling on Heterogeneous Machines
Mozhengfu Liu, Xueyan Tang
This paper studies a generalized busy-time scheduling model on heterogeneous machines. The input to the model includes a set of jobs and a set of machine types. Each job has a size…
On the Reliability and Concurrent Unicast Transmission Node Control of 5G NR-V2X Networks
Ke Li, Li Li, Wenpeng Wu +2
In vehicle-to-everything (V2X) communications, reliability is one of the most important performance metrics in safety-critical applications such as advanced driving, remote driving…
Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint
Jing Tang, Xueyan Tang, Andrew Lim +3
Monotone submodular maximization with a knapsack constraint is NP-hard. Various approximation algorithms have been devised to address this optimization problem. In this paper, we r…
Efficient Approximation Algorithms for Adaptive Influence Maximization
Keke Huang, Jing Tang, Kai Han +5
Given a social network and an integer , the influence maximization (IM) problem asks for a seed set of nodes from to maximize the expected number of nodes influe…
Efficient Approximation Algorithms for Adaptive Seed Minimization
Jing Tang, Keke Huang, Xiaokui Xiao +4
As a dual problem of influence maximization, the seed minimization problem asks for the minimum number of seed nodes to influence a required number of users in a given social n…
Towards Profit Maximization for Online Social Network Providers
Jing Tang, Xueyan Tang, Junsong Yuan
Online Social Networks (OSNs) attract billions of users to share information and communicate where viral marketing has emerged as a new way to promote the sales of products. An OSN…
Influence Maximization Meets Efficiency and Effectiveness: A Hop-Based Approach
Jing Tang, Xueyan Tang, Junsong Yuan
Influence Maximization is an extensively-studied problem that targets at selecting a set of initial seed nodes in the Online Social Networks (OSNs) to spread the influence as widel…
Rank-Aware Dynamic Migrations and Adaptive Demotions for DRAM Power Management
Yanchao Lu, Donghong Wu, Bingsheng He +3
Modern DRAM architectures allow a number of low-power states on individual memory ranks for advanced power management. Many previous studies have taken advantage of demotions on lo…