A Linear Time Algorithm for the Optimal Discrete IRS Beamforming
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Wireless Communications Letters"
DOI: 10.1109/lwc.2022.3232146
Abstract: It remains an open problem to find the optimal configuration of phase shifts under the discrete constraint for intelligent reflecting surface (IRS) in polynomial time. The above problem is widely believed to be difficult because… read more here.
Keywords: algorithm optimal; time; time algorithm; number ... See more keywords
A Distributed Continuous-Time Algorithm for Nonsmooth Constrained Optimization
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Transactions on Automatic Control"
DOI: 10.1109/tac.2020.2965905
Abstract: This article studies a distributed convex optimization problem with nonsmooth local objective functions subject to local inequality constraints and a coupled equality constraint. By combining the dual decomposition technique and subgradient flow method, a new… read more here.
Keywords: optimization; time; distributed continuous; algorithm nonsmooth ... See more keywords
Linear-time algorithm for phase-sensitive holography
Sign Up to like & getrecommendations! Published in 2020 at "Optical Engineering"
DOI: 10.1117/1.oe.59.8.085104
Abstract: Abstract. Holographic search algorithms such as direct search (DS) and simulated annealing allow high-quality holograms to be generated at the expense of long execution times. This is due to single iteration computational costs of O ( NxNy ) … read more here.
Keywords: phase sensitive; linear time; algorithm phase; phase ... See more keywords
Polynomial-Time Algorithm for Learning Optimal BFS-Consistent Dynamic Bayesian Networks
Sign Up to like & getrecommendations! Published in 2018 at "Entropy"
DOI: 10.3390/e20040274
Abstract: Dynamic Bayesian networks (DBN) are powerful probabilistic representations that model stochastic processes. They consist of a prior network, representing the distribution over the initial variables, and a set of transition networks, representing the transition distribution… read more here.
Keywords: polynomial time; dynamic bayesian; bayesian networks; time ... See more keywords
Independent Roman Domination: The Complexity and Linear-Time Algorithm for Trees
Sign Up to like & getrecommendations! Published in 2022 at "Symmetry"
DOI: 10.3390/sym14020404
Abstract: For a graph G=(V,E), an independent Roman dominating function (IRDF) is a function f:V→{0,1,2} having the property that: (1) every vertex assigned a value of 0 is adjacent to at least one vertex assigned a… read more here.
Keywords: function; time algorithm; independent roman; linear time ... See more keywords