Zobrazeno 1 - 10
of 137
pro vyhledávání: '"Mirzaei, Saber"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Openflow provides a standard interface for separating a network into a data plane and a programmatic control plane. This enables easy network reconfiguration, but introduces the potential for programming bugs to cause network effects. To study OpenFl
Externí odkaz:
http://arxiv.org/abs/1604.00060
Autor:
Mirzaei, Saber, Kfoury, Assaf
In contrast to traditional flow networks, in additive flow networks, to every edge e is assigned a gain factor g(e) which represents the loss or gain of the flow while using edge e. Hence, if a flow f(e) enters the edge e and f(e) is less than the de
Externí odkaz:
http://arxiv.org/abs/1603.08997
Autor:
Mirzaei, Saber, Kfoury, Assaf
The reassembling of a simple connected graph G = (V,E) is an abstraction of a problem arising in earlier studies of network analysis. The reassembling process has a simple formulation (there are several equivalent formulations) relative to a binary t
Externí odkaz:
http://arxiv.org/abs/1602.02863
Autor:
Mirzaei, Saber
The general communication tree embedding problem is the problem of mapping a set of communicating terminals, represented by a graph G, into the set of vertices of some physical network represented by a tree T. In the case where the vertices of G are
Externí odkaz:
http://arxiv.org/abs/1601.02697
Autor:
Mirzaei, Saber, Kfoury, Assaf
We study the Optimal Linear Arrangement (OLA) problem of Halin graphs, one of the simplest classes of non-outerplanar graphs. We present several properties of OLA of general Halin graphs. We prove a lower bound on the cost of OLA of any Halin graph,
Externí odkaz:
http://arxiv.org/abs/1509.08145
Autor:
Kfoury, Assaf, Mirzaei, Saber
The reassembling of a simple connected graph G = (V,E) is an abstraction of a problem arising in earlier studies of network analysis. Its simplest formulation is in two steps: (1) We cut every edge of G into two halves, thus obtaining a collection of
Externí odkaz:
http://arxiv.org/abs/1509.06434
Autor:
Mirzaei, Saber, Esposito, Flavio
Max Consensus-based Auction (MCA) protocols are an elegant approach to establish conflict-free distributed allocations in a wide range of network utility maximization problems. A set of agents independently bid on a set of items, and exchange their b
Externí odkaz:
http://arxiv.org/abs/1407.5074
Publikováno v:
In Tetrahedron 29 November 2019 75(48)
