Zobrazeno 1 - 10
of 42
pro vyhledávání: '"José Alberto Fernández-Zepeda"'
Autor:
Joel Antonio Trejo-Sánchez, Francisco A. Madera-Ramírez, José Alberto Fernández-Zepeda, José Luis López-Martínez, Alejandro Flores-Lamas
Publikováno v:
Optimization Letters. 17:1435-1454
Publikováno v:
Journal of Parallel and Distributed Computing. 142:62-76
In this work, we propose Maximal-2-Packing-Halin , a distributed algorithm that finds a maximal 2-packing set in undirected non-geometric Halin graphs of order n in linear time. First, this algorithm finds an external face of the input graph through
Publikováno v:
Theoretical Computer Science. 725:31-51
In this paper, we address the problem of finding a maximum 2-packing set in a cactus. Let G = ( V G , E G ) be an undirected connected graph; then a subset S ⊆ V G is a 2-packing set if for every pair of vertices u , v ∈ S , the shortest path bet
Publikováno v:
IEEE Access, Vol 6, Pp 28447-28466 (2018)
This paper introduces the maximum uniform message distribution (MUMD) problem, which can be present in delay-tolerant communication networks, where the destination of the messages is not present in the network. This type of behavior arises in scenari
Publikováno v:
International Journal of Foundations of Computer Science. 28:1021-1045
In this paper, we present a self-stabilizing algorithm that computes a maximal 2-packing set in a cactus under the adversarial scheduler. The cactus is a network topology such that any edge belongs to at most one cycle. The cactus has important appli
Autor:
Alejandra Perez-Mena, José Alberto Fernández-Zepeda, Himer Avila-George, Juan Pablo Rivera-Caicedo
Publikováno v:
RISTI-Revista Ibérica de Sistemas e Tecnologias de Informação, Issue: 31, Pages: 118-133, Published: MAR 2019
RISTI-Revista Ibérica de Sistemas e Tecnologias de Informação n.31 2019
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Agência para a Sociedade do Conhecimento (UMIC)-FCT-Sociedade da Informação
instacron:RCAAP
RISTI-Revista Ibérica de Sistemas e Tecnologias de Informação n.31 2019
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Agência para a Sociedade do Conhecimento (UMIC)-FCT-Sociedade da Informação
instacron:RCAAP
espanolEn este articulo, se introduce PulAm, una aplicacion movil basada en el sistema operativo movil Android. Esta aplicacion se diseno como una herramienta de apoyo en el proceso de monitoreo de plagas de diferentes cultivos. Como caso de estudio,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::021b97e65f6e417b4419dfbed8eae855
http://www.scielo.mec.pt/scielo.php?script=sci_arttext&pid=S1646-98952019000100010&lng=en&tlng=en
http://www.scielo.mec.pt/scielo.php?script=sci_arttext&pid=S1646-98952019000100010&lng=en&tlng=en
Publikováno v:
Journal of Software: Evolution and Process. 28:372-390
Software process improvement SPI has become one of the main strategies employed by small software enterprises to reduce their development costs or to increase the quality of their products and their development speed. Recent studies show that many sm
Autor:
José Alberto Fernández-Zepeda, Himer Avila-George, Alejandra Perez-Mena, Juan Pablo Rivera-Caicedo
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783030011703
In this paper, we introduce PulAm a mobile application based on the Android operating system, which was designed as a support tool for the monitoring process of different crops. As a case study, we introduced the monitoring of sorghum crops, specific
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b5398f21dcdaf893e465e6415df84364
https://doi.org/10.1007/978-3-030-01171-0_18
https://doi.org/10.1007/978-3-030-01171-0_18
Autor:
Héctor Zatarain-Aceves, Carlos A. Brizuela, José Alberto Fernández-Zepeda, Daniel Fajardo-Delgado
Publikováno v:
Applied Soft Computing. 37:643-651
Graphical abstractDisplay Omitted HighlightsThis paper address the bodyguard allocation problem (BAP) through an evolutionary approach.The paper proposes a two-stage cascade evolutionary algorithm that outperforms the state-of-the-art algorithm, know
Publikováno v:
Journal of Parallel and Distributed Computing. 74:2193-2202
In this paper, we present a deterministic distributed algorithm that computes the maximal 2-packing set in a geometric outerplanar graph. In a geometric outerplanar graph, all the vertices have location coordinates in the plane and lie on the boundar