Výsledky vyhľadávania - Efficient approximation algorithms

Multicell Coordinated Beamforming With Rate Outage Constraint-Part II: Efficient Approximation Algorithms Autor Li, Wei-Chiang, Chang, Tsung-Hui, Chi, Chong-Yung

“… Therefore, the focus of this paper is on suboptimal but computationally efficient algorithms…”
Získať plný text

Efficient approximation algorithm for the Schrödinger–Possion system Autor He, Xuefei, Wang, Kun

“…In this article, we study an efficient approximation algorithm for the Schrödinger–Possion system arising in the resonant tunneling diode…”
Získať plný text

An Efficient Approximation Algorithm for Service Function Chaining Placement in Edge-Cloud Computing Industrial Internet of Things Autor Asgarian, Mina, Jamshidi, Kamal, Bohlooli, Ali

“…Edge-Cloud Computing Industrial Internet of Things (ECIIoT) is composed of edge and cloud nodes with Industrial Internet of Things (IIoT) devices to get the…”
Získať plný text

Efficient approximation algorithms for scheduling moldable tasks Autor Wu, Xiaohu, Loiseau, Patrick

“…•An efficient algorithm for makespan minimization is proposed, achieving an approximation ratio close…”
Získať plný text

Efficient approximation algorithms for adaptive influence maximization Autor Huang, Keke, Tang, Jing, Han, Kai, Xiao, Xiaokui, Chen, Wei, Sun, Aixin, Tang, Xueyan, Lim, Andrew

“… The majority of the existing algorithms for the IM problem are developed only under the non-adaptive setting, i.e…”
Získať plný text

Efficient Approximation Algorithms for Server Allocation to Minimize Total Capacity under Server Failure Autor Inoue, Masahiro, Oki, Eiji

“…Real-time applications, such as ticket booking systems, video streaming systems, social networking services, and online games, are prevalent nowadays. Low…”
Získať plný text

Efficient Approximation Algorithms for the Bounded Flexible Scheduling Problem in Clouds Autor Guo, Longkun, Shen, Hong

“… This paper presents a factor C/C-k approximation algorithm…”
Získať plný text

An efficient ensemble algorithm for numerical approximation of stochastic Stokes–Darcy equations Autor Jiang, Nan, Qiu, Changxin

“…We propose and analyze an efficient ensemble algorithm for fast computation of multiple realizations of the stochastic Stokes…”
Získať plný text

Efficient Approximation Algorithms for Scheduling Coflows With Precedence Constraints in Identical Parallel Networks to Minimize Weighted Completion Time Autor Chen, Chi-Yeh

“… When considering workload sizes and weights that are dependent on the network topology in the input instances, the proposed algorithm for the flow-level scheduling problem…”
Získať plný text

Efficient Approximation Algorithms for Several Positive Influence Dominating Set Problems in Social Networks Autor Zhong, Hao, Li, Weisheng, Zhang, Qi, Lin, Ronghua, Tang, Yong

“… The purpose of this article is to propose new approximation algorithms for the minimum PIDS problem and its variants such as the minimum connected PIDS and the minimum PIDS of multiplex networks…”
Získať plný text

Adaptive CSMA Under the SINR Model: Efficient Approximation Algorithms for Throughput and Utility Maximization Autor Swamy, Peruru Subrahmanya, Ganti, Radha Krishna, Jagannathan, Krishna

“… We propose two local optimization-based approximation algorithms to efficiently estimate certain attempt rate parameters of CSMA called fugacities…”
Získať plný text

Efficient Approximation Algorithms for Scheduling Coflows With Total Weighted Completion Time in Identical Parallel Networks Autor Chen, Chi-Yeh

“…This article addresses the scheduling problem of coflows in identical parallel networks, a well-known <inline-formula><tex-math notation="LaTeX">\mathcal…”
Získať plný text

Efficient approximation algorithms for offline and online unit disk multiple coverage Autor Gao, Xuening, Guo, Longkun, Liao, Kewen

“…Multiple coverage with unit disks is a problem widely seen in monitoring applications of wireless sensor networks. In this problem, let T=t1,t2,…,tn be a set…”
Získať plný text

Greedy+Singleton: An efficient approximation algorithm for k-submodular knapsack maximization Autor Tang, Zhongzheng, Chen, Jingwen, Wang, Chenhao

Získať plný text

Efficient Approximation Algorithms for Adaptive Target Profit Maximization Autor Huang, Keke, Tang, Jing, Xiao, Xiaokui, Sun, Aixin, Lim, Andrew

“… Existing algorithms for PM mostly consider the nonadaptive setting, where all seed nodes are selected in one batch without any knowledge on how they may influence other users…”
Získať plný text

An efficient approximation algorithm for the nonlinear reaction: diffusion equations in an electro catalytic thin film models using Hosoya polynomials Autor Bhuvaneswari, M., Vinoba, V., Hariharan, G.

“… A new Hosoya polynomial approximation method (HPAM) is applied for solving the reaction…”
Získať plný text

On the Convergence of an Efficient Algorithm for Kullback-Leibler Approximation of Spectral Densities Autor Ferrante, Augusto, Ramponi, Federico, Ticozzi, Francesco

“… After developing the variational analysis, we discuss the properties of an efficient algorithm for the solution of the corresponding dual problem, based on the iteration of a nonlinear map…”
Získať plný text

Efficient approximation algorithms for the routing open shop problem Autor Chernykh, Ilya, Kononov, Alexander, Sevastyanov, Sergey

“… We present new polynomial-time approximation algorithms with worst-case performance guarantees…”
Získať plný text

An efficient approximation algorithm for variance global sensitivity by Bayesian updating Autor Chen, Pu, Lu, Zhenzhou

“… In the proposed algorithm, the input realizations are firstly treated as observations to construct a likelihood function…”
Získať plný text

Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs Autor Obata, Yuji, Nishizeki, Takao

“… In the paper, we present four efficient approximation algorithms for the problem, which have theoretical performance guarantees for the computation time, the span of a found b-coloring and the approximation ratio. We also obtain several upper bounds on the minimum span, expressed in terms of the maximum b-degrees, one of which is an extension of Brooks' theorem on an ordinary coloring…”
Získať plný text