In this paper, we offer a review o. lpe-3 fuzzy logic systems and their applications in control.
The main objective of this work is to observe and analyze in detail the applications in the …

We consider the computational problem of finding short paths in the skeleton of the perfect
matching polytope of a bipartite graph. We prove that unless P= NP, there is no polynomial …

The purpose of this paper is the formal verification of a counterexample of Santos et al. to the
so-called Hirsch Conjecture on the diameter of polytopes (bounded convex polyhedra). In …

We construct a family of Markov decision processes for which the policy iteration algorithm
needs an exponential number of improving switches with Dantzig's rule, with Bland's rule …

Accurate diagnosis of transformer faults can effectively improve the enduring reliability of
power grid operation. Aiming at overcoming the problems of long time consumption and low …

We show subexponential lower bounds (ie, 2Ω (nc)) on the smoothed complexity of the
classical Howard's Policy Iteration algorithm for Markov Decision Processes. The bounds …

The simplex method for linear programming is known to be highly efficient in practice, and
understanding its performance from a theoretical perspective is an active research topic. The …

The article presents a new method of linear programming, called the surface movement
method. This method constructs an optimal objective path on the surface of the feasible …

This paper presents a state-of-the-art algorithm for the vertex enumeration problem of
arrangements, which is based on the proposed new pivot rule, called the Zero rule. The Zero …

We present a polynomial-time reduction from max-average constraints to the feasibility
problem for semidefinite programs. This shows that Condon's simple stochastic games …