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...
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...
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...
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. ...
The new schemes are fully compatible with the existing ATM standard, and have low hardware complexity. All MMRCA schemes converge to the same fair share for all connections as EPRCA, but achieve faster convergence time; the enhanced MMRCA schemes also require smaller buffer sizes at the switches...
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...
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 ...
As a consequence of the hypothesis testing equivalence, calculation of the activation map with local spatial priors can be formulated as mincut/maxflow graph-cutting problem. Such problems can be solved in polynomial time by the Ford ... J Kim,JW Fisher,A Tsai,... - Third International Conf...
Every new game is a new piece of music that starts out simple and gradually increases in complexity. The music evolves with the board, and adds a new dimension for players to interact with the game. If you want to try it out yourself, [Sara] has the project fully documented onher web...
So how did Adventure Time showrunner Adam Muto spin these two into a whole new mini-series when Fionna and Cake weren't even canon?* Finding out is just part of the fun of this inventive mini-series. But be warned: this one will mess you up. How to watch: Fionna and Cake is ...