computational complexitypolynomial-time approximation schememin-max subsequence problemWe determine the computational complexity of the problem of ordering a set of n numbers, either into a sequence or a cycle, such that the maximum sum of any k successive numbers is minimal. Both problems are easy...
Max Xu (Stanford) 01:12:25 Marco Aymone (UFMG) 50:44 Maksym Radziwill (Caltech) 01:09:10 Dimension theory of self-similar sets and measures – Michael Hochman – ICM2018 45:59 Oleksiy Klurman (Bristol) 54:24 Rachid Caich Almost sure upper bound for random multi-plicative functi...
Max-Min Fairness refers to a scheduling mechanism in computer networks where resources are allocated to ensure that no link's utility exceeds another link's utility without decreasing it. It aims to maximize the minimum share of resources among users, promoting fairness in data flow. ...
We study the complexity of a class of circuits, namely, the MAX/MIN/AVRG circuits. On the wires of these circuits are real values between 0 and 1; the functions each gate performs are MAX, MIN, and AVERAGE of fan-in 2; there can be feed-backs in the circuit. It can be shown tha...
Convergence of max–min consensus algorithms In this paper, we propose a distributed max–min consensus algorithm for a discrete-timen-node system. Each node iteratively updates its state to a weighte... G Shi,W Xia,KH Johansson - 《Automatica》 被引量: 10发表: 2015年 Distributed optimizatio...
The computational complexity of optimization problems of the min-max form is natu- rally characterized by P2 , the second level of the polynomial-time hierarchy. We present a number of optimization problems of this form and show that they are complete for the class P2 . We also show that th...
for the MAX-MIN flow control of elastic traffic services with minimum rate guarantee in the setting of the ATM available bit rate (ABR) service. The... Song Chong,,Sangho Lee,,Sungho Kang, - 《Networking IEEE/ACM Transactions on》 被引量: 125发表: 2001年 Charging and rate control for ...
Reduced Energy Min-Max Decoding Algorithm for Ldpc Code with Adder Correction Technique 来自 d.researchbib.com 喜欢 0 阅读量: 48 作者:AV Manjupriya,G Yuvaraj 摘要: In this paper, high linear architectures for analysing the first two maximum or minimum values are of paramount importance in ...
The problem is that min-maxxing bleeds into the mindset of the community and those who don't want to min-max at the approved level are shunned, mocked, and denied access to content. When I was interested in playing Classic I really wanted to be a Shadow Priest. I loved the old Shadow...
While the considered design problem is non-convex and difficult to solve in general, we show in this paper that the problem can actually be globally solved in a polynomial-time complexity if the residual SI has a spatially white channel covariance matrix. The proposed optimal method is ...