Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Marisa Zaragozá"'
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Politècnica de Catalunya (UPC)
As a result of advances in technology and highly demanding users expectations, more and more applications require intensive computing resources and, most importantly, high consumption of data distributed throughout the environment. For this reason, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::60f60e5cfed77d46aef609344b7dd3fe
http://hdl.handle.net/2117/351355
http://hdl.handle.net/2117/351355
Autor:
Marisa Zaragozá, Jordi Garcia, Xavi Masip-Bruin, Francesc Aguiló, Andres Prieto-Gonzalez, Ester Simó, Yunsong Lu, Joan Molinas-Ramon
Publikováno v:
HPSR
Smart cities are becoming popular and, with them, a plethora of resources is emerging turning into a massive concentration of computing devices. In such environments, the deployment of a smart resources management system is envisioned as an extraordi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2fe0412c0e0fadf90ef45d9139d4870f
https://doi.org/10.1109/hpsr.2019.8808109
https://doi.org/10.1109/hpsr.2019.8808109
Publikováno v:
Electronic Notes in Discrete Mathematics. 28:61-68
Given a set A = { a 1 , … , a k } with 1 ⩽ a 1 … a k and g cd ( a 1 , … , a k ) = 1 , let us denote R ( A ) = { m ∈ N | ∃ λ 1 , … , λ k ∈ N : m = ∑ i = 1 k λ i a i } and R ¯ ( A ) = N \ R ( A ) . The classical study of the Frobe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c76de86a27c2e4c4479b220f26a4792
https://doi.org/10.1016/j.endm.2007.01.010
https://doi.org/10.1016/j.endm.2007.01.010
Publikováno v:
Electronic Notes in Discrete Mathematics. 24:17-24
Given a set A = { a 1 , … , a k } with 1 ⩽ a 1 … a k and gcd ( a 1 , … , a k ) = 1 , let us denote R ( A ) = { m ∈ N | ∃ x 1 , … , x k ∈ N : m = ∑ i = 1 k x i a i } and R ¯ ( A ) = N \ R ( A ) . The classical study of the Frobenius
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::758f60ec241aed018ce40e002e7bffdd
https://doi.org/10.1016/j.endm.2006.06.004
https://doi.org/10.1016/j.endm.2006.06.004
Publikováno v:
ResearcherID
This paper studies routing vulnerability in networks modeled by chordal ring graphs. In a chordal ring graph, the vertices are labeled in ℤ2n and each even vertex i is adjacent to the vertices i + a, i + b, i, + c, where a, b, and c are different o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2bc1fe6a235606bc04d96583883e9165
https://doi.org/10.1002/1097-0037(200010)36:3<180::aid-net5>3.0.co
https://doi.org/10.1002/1097-0037(200010)36:3<180::aid-net5>3.0.co
Publikováno v:
International Journal of Foundations of Computer Science. :57-76
The network properties of double and triple fixed step graphs are considered. We determine that the broadcast times of double and triple fixed step graphs of diameter D are equal to D+2 and D+3, respectively. Some results on the embeddings of grids i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18359b0a5d4a0e41e52ec0635542a7bd
https://doi.org/10.1142/s0129054198000076
https://doi.org/10.1142/s0129054198000076
Autor:
J. Fàbrega, Marisa Zaragozá
Publikováno v:
Discrete Applied Mathematics. 78:61-74
This paper studies routing vulnerability in loop networks modeled by double fixed step-graphs. A double fixed step-graph has its vertices labeled with the integers modulo n and each vertex i is adjacent to the vertices i ± a (modn), i ± b (mod n),
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b86c1bea2246586683aeddc92114ab7
https://doi.org/10.1016/s0166-218x(97)00015-2
https://doi.org/10.1016/s0166-218x(97)00015-2
Publikováno v:
The Electronic Journal of Combinatorics. 10
A double-loop digraph $G(N;s_1,s_2)=G(V,E)$ is defined by $V={\bf Z}_N$ and $E=\{(i,i+s_1), (i,i+s_2)|\; i\in V\}$, for some fixed steps $1\leq s_1 < s_2 < N$ with $\gcd(N,s_1,s_2)=1$. Let $D(N;s_1,s_2)$ be the diameter of $G$ and let us define $$ D(
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::66144438bd7e40be7bc0300f026279ff
https://doi.org/10.37236/1695
https://doi.org/10.37236/1695