Zobrazeno 1 - 10
of 19
pro vyhledávání: '"José Luis López-Presa"'
Publikováno v:
Journal of Applied Mathematics, Vol 2014 (2014)
Graph automorphism (GA) is a classical problem, in which the objective is to compute the automorphism group of an input graph. Most GA algorithms explore a search tree using the individualization-refinement procedure. Four novel techniques are propos
Externí odkaz:
https://doaj.org/article/f6a202da1e114175b3f82ef0599a172a
Publikováno v:
Sensors, Vol 16, Iss 6, p 816 (2016)
In this paper, a method of verification of the power performance of a wind farm is presented. This method is based on the Friedman’s test, which is a nonparametric statistical inference technique, and it uses the information that is collected by th
Externí odkaz:
https://doaj.org/article/2f92632ff8b24123bee002d4ab5d181e
Publikováno v:
Computing. 105:1165-1187
Publikováno v:
IEEE Access, Vol 9, Pp 163987-164005 (2021)
To take full advantage of the available network capacity, connections need to be able to use multiple paths to route their packets. Max-min fairness (MMF) can be effectively applied to single-path networks, but computing MMF rates in multipath networ
Publikováno v:
Journal of Computer and System Sciences. 107:54-71
We study consensus in asynchronous systems where membership is unknown, and where up to f degenerative Byzantine failures can happen. In our failure model a faulty process can have a Byzantine behavior (i.e., it deviates from its specification), and,
Autor:
Carlos Barroso-Fernandez, Ernesto Jimenez, Jose Luis Lopez-Presa, Marta Moreno-Cuesta, Ramon Xulvi-Brunet
Publikováno v:
IEEE Access, Vol 12, Pp 4701-4715 (2024)
A gossip protocol is a procedure by which a device disseminates its rumor to all devices on a network. The traditional definition of the gossip problem states that, in a system with $n$ interconnected devices where each of them only knows initially i
Externí odkaz:
https://doaj.org/article/77cf585a57704d11b5bbc11cc029b75b
Publikováno v:
Expert Systems with Applications
IMDEA Networks Institute Digital Repository
instname
IMDEA Networks Institute
IMDEA Networks Institute Digital Repository
instname
IMDEA Networks Institute
Given the higher demands in network bandwidth and speed that the Internet will have to meet in the near future, it is crucial to research and design intelligent and proactive congestion control and avoidance mechanisms able to anticipate decisions be
Publikováno v:
The Journal of Supercomputing
Fault tolerance and agreement are essential capabilities of current distributed systems. In this context, Binary Consensus is a key problem. It is well-known that consensus cannot be solved in a pure asynchronous system when at least one process can
Publikováno v:
Sensors (Basel, Switzerland)
Sensors, Vol 16, Iss 6, p 816 (2016)
Sensors; Volume 16; Issue 6; Pages: 816
Repositorio Universidad Técnica Particular de Loja
Universidad Técnica Particular de Loja
instacron:UTPL
Sensors, Vol 16, Iss 6, p 816 (2016)
Sensors; Volume 16; Issue 6; Pages: 816
Repositorio Universidad Técnica Particular de Loja
Universidad Técnica Particular de Loja
instacron:UTPL
In this paper, a method of verification of the power performance of a wind farm is presented. This method is based on the Friedman�s test, which is a nonparametric statistical inference technique, and it uses the information that is collected by th
Publikováno v:
ResearcherID
Scopus-Elsevier
Scopus-Elsevier
In this paper, we study containment properties of graphs in relation with the Cartesian product operation. These results can be used to derive embedding results for interconnection networks for parallel architectures. First, we show that the isomorph