Results 21 to 30 of about 977 (189)
In max-plus algebra, some algorithms for determining the eigenvector of irreducible matrices are the power algorithm and the Kleene star algorithm. In this research, a modified Kleene star algorithm will be discussed to compensate for the disadvantages ...
Ema Carnia +4 more
doaj +1 more source
17 pages, 1 ...
Watanabe, Sennosuke +3 more
openaire +3 more sources
Ordered Structures of Polynomials over Max-Plus Algebra [PDF]
The ordered structures of polynomial idempotent algebras over max-plus algebra are investigated in this paper. Based on the antisymmetry, the partial orders on the sets of formal polynomials and polynomial functions are introduced to generate two partially ordered idempotent algebras (POIAs).
Cailu Wang, Yuanqing Xia, Yuegang Tao
openaire +1 more source
Extending Eigentrust with the Max-Plus Algebra
Eigentrust is a simple and widely used algorithm, which quantifies trust based on the repeated application of an update matrix to a vector of initial trust values. In some cases, however, this procedure is rendered uninformative. Here, we characterise such situations and trace their origin to the algebraic conditions guaranteeing the convergence of the
Juan Afanador +3 more
openaire +2 more sources
Two-level priority scheduling framework in a max-plus linear representation
A common type of scheduling policy includes first-in-first-out (FIFO) and earliest-outset bases. Among many approaches to this, max-plus linear representation is beneficial for event-driven discrete event systems (DESs).
Kyohei Sagawa +2 more
doaj +1 more source
This paper considers the inland waterborne transport (IWT) problem, and presents a scheduling approach for inland vessels and locks to generate optimal vessel and lock timetables. The scheduling strategy is designed in the switching max-plus-linear (SMPL)
Pablo Segovia +3 more
doaj +1 more source
Max-Plus Algebra and Discrete Event Systems
This paper is a historical overview of research done in Max-Plus Algebra within the Discrete-Event Systems community since the emergence of the theory of Max-Plus linear systems in the early 80s.
Komenda, Jan +3 more
openaire +4 more sources
CRAMER’S RULE IN MIN-PLUS ALGEBRA
Cramer’s rule is one of a method for solving a system of linear equations in conventional algebra. The system of linear equation can be solved using Cramer’s rule if .
Zakia Nur Ramadhani Putri +2 more
doaj +1 more source
Branching Processes, the Max-Plus Algebra and Network Calculus [PDF]
Branching processes can describe the dynamics of various queueing systems, peer-to-peer systems, delay tolerant networks, etc. In this paper we study the basic stochastic recursion of multitype branching processes, but in two non-standard contexts. First, we consider this recursion in the max-plus algebra where branching corresponds to finding the ...
Altman, Eitan, Fiems, Dieter
openaire +3 more sources
The Singular Value Decomposition over Completed Idempotent Semifields
In this paper, we provide a basic technique for Lattice Computing: an analogue of the Singular Value Decomposition for rectangular matrices over complete idempotent semifields (i-SVD).
Francisco J. Valverde-Albacete +1 more
doaj +1 more source

