نتایج جستجو برای: dioid
تعداد نتایج: 42 فیلتر نتایج به سال:
Let us consider a parametric weighted directed graph in which every arc (j,i) has weight of the form w((j,i))=max(Pij+λ,Iij−λ,Cij), where λ is real parameter and P, I C are arbitrary square matrices with elements R∪{−∞}. In this paper, we design an algorithm that solves Non-positive Circuit Problem (NCP) on class graphs, consists finding all values such does not contain circuits positive weight...
Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...
A fundamental problem for the delay and backlog analysis across multi-hop paths in wireless networks is how to account for the random properties of the wireless channel. Since the usual statistical models for radio signals in a propagation environment do not lend themselves easily to a description of the available service rate, the performance analysis of wireless networks has resorted to highe...
A fundamental problem for the delay and backlog analysis across multi-hop paths in wireless networks is how to account for the random properties of the wireless channel. Since the usual statistical models for radio signals in a propagation environment do not lend themselves easily to a description of the available service rate, the performance analysis of wireless networks has resorted to highe...
The class of Timed Event Graphs (TEGs) has widely been studied for the last 30 years thanks to an algebraic approach known as the theory of Max-Plus linear systems. In particular, the modeling of TEGs via formal power series has led to input-output descriptions for which some model matching control problems have been solved. In the context of manufacturing applications, the controllers obtained...
Exotic semirings such as the “(max;+) semiring” (R[f 1g;max;+), or the “tropical semiring” (N[f+1g;min;+), have been invented and reinvented many times since the late fifties, in relation with various fields: performance evaluation of manufacturing systems and discrete event system theory; graph theory (path algebra) and Markov decision processes, Hamilton-Jacobi theory; asymptotic analysis (lo...
Considering probability theory in which the semifield of positive real numbers is replaced by the idempotent semifield of real numbers (union infinity) endowed with the min and plus laws leads to a new formalism for optimization. Probability measures correspond to minimums of functions that we call cost measures, whereas random variables correspond to constraints on these optimization problems ...
Considering measure theory in which the semifield of positive real numbers is replaced by an idempotent semiring leads to the notion of idempotent measure introduced by Maslov. Then, idempotent measures or integrals with density correspond to supremums of functions for the partial order relation induced by the idempotent structure. In this paper, we give conditions under which an idempotent mea...
Th/s paper extends the authors" parallel nested dissection algorithm of [13] originally devised for solving sparse lhteaf systems. We present a class of new applications of the nested dissection method, this time to path algebra compulal~,.hs (in both car~ of single source and all pair paths), where the, ~ ~ problem is defined by a symmetric malrix .4 who~ asem¢is4~i graph G with n verticex is ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید