In this paper a method to check the solvability of a set of linear equations in the (max, min, +) algebra is described. Then, extensions to dynamic (or periodic) systems in the (max, min, +) algebra are provided. Further, some results regarding the uniqueness of solutions in both case...
Note that the space of convex functions is a max-plus linear space, or moduloid. In extending those concepts to game problems, one finds a different function space, and different algebra, to be appropriate. Here we consider functions which may be represented using infima (i.e., min-max ...
Max-min problems on the ranks and inertias of the matrix expressions $A-BXCpm(BXC)sp ast$ with applications. Y. Liu and Y. Tian, Max-min problems on the ranks and inertias of the matrix expressions A - BXC ± (BXC)∗ with applications, J. Optim. ... Y Liu,Y Tian - 《Journal...
On the entropic regularization method for solving min-max problems with applications Consider a min-max problem in the form of min x ε X max 1≤ i ≤ m { f i ( x )}. It is well-known that the non-differentiability of the max function... XS Li,SC Fang - 《Mathematical Methods ...
Min & Max Terms Notation in Boolean Algebra Mapping of expressions on K-Map & Encircling of groups Karnaugh Maps with Don't Care Conditions Combinational Circuits & Its Design Procedure Half & Full Adders, Design Full Adder Using Half Adder Half & Full Subtractors, Design Full Subtractor Using...
关键词: discrete event systems floating point arithmetic minimax techniques CalcCycleTime algorithm FPCalcCycleTime algorithm cycle time floating point computation functions spectral radius min-max functions Algebra Application software DOI: 10.1109/ICCA.2005.1528265 被引量: 1 ...
On the other hand, we prove that some problems concerning the structure of successful coalitions are hard also in the case of sharable resources. AMS classification 91B68; 68Q25 Keywords Max–min algebra; System of linear equations; Cooperative game; Computational complexity References [1] F....
max-min algebraperiodicityvector orbitscoordinate-orbit periodNP-hardmaximum sequence periodPeriodicity of vector orbits in max–min algebra is studied. It is proved that computing the coordinate-orbit period is NP-hard, while the orbit period can be computed in O( n 4) time. A related problem...
We extend the perturbation theory of Vishik, Ljusternik and Lidskii for eigenvalues of matrices, using methods of min-plus algebra. We show that the asymptotics of the eigenvalues of a perturbed matrix is governed by certain discrete optimisation problems, from which we derive new perturbation ...
On the dimension of max-min convex sets We describe the relation between this rank and the notion of strong\nregularity in max-min algebra, which is traditionally defined in terms of\nunique solvability of linear systems and trapezoidal property... S Sergeev,V Nitica 被引量: 0发表: 2013...