Zobrazeno 1 - 10
of 130
pro vyhledávání: '"J. Raymundo Marcial-Romero"'
Autor:
Ivan Francisco Valencia, Rosa María Valdovinos Rosas, J. Raymundo Marcial Romero, Roberto Alejo Eleuterio
Publikováno v:
ReCIBE, Vol 11, Iss 2 (2023)
El presente artículo tiene como objetivo mostrar la evolución del desarrollo de agentes inteligentes capaces de jugar juegos de tablero. Se muestra una breve revisión histórica de los agentes que se han desarrollado para diversos juegos y se desc
Externí odkaz:
https://doaj.org/article/28f8b6e794444376a2ebca9ac06d78bf
Autor:
Angélica Guzmán Ponce, J. Salvador Sanchéz, Rosa M. Valdovinos Rosas, J. Raymundo Marcial Romero
Publikováno v:
Programación Matemática y Software, Vol 11, Iss 1 (2019)
Las aplicaciones de Big Data son tema central de la investigación actual en muchos campos debido a la creciente producción de enormes cantidades de datos. Una dificultad importante de los datos, tanto en los problemas de la vida real tradicionales
Externí odkaz:
https://doaj.org/article/af3be816cdee4e50a6faffe93006702c
Publikováno v:
Journal of Intelligent & Fuzzy Systems. 42:4719-4726
We present a novel algorithm based on combinatorial operations on lists for computing the number of models on two conjunctive normal form Boolean formulas whose restricted graph is represented by a grid graph Gm,n. We show that our algorithm is corre
Autor:
Marco Antonio López-Medina, J. Leonardo González-Ruiz, J. Raymundo Marcial-Romero, J. A. Hernández
Publikováno v:
Computación y Sistemas. 26
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.
Publikováno v:
Logic Journal of the IGPL. 28:1130-1140
Counting models for a two conjunctive formula (2-CF) $F$, a problem known as $\sharp $2Sat, is a classic $\sharp $P complete problem. Given a 2-CF $F$ as input, its constraint graph $G$ is built. If $G$ is acyclic, then $\sharp $2Sat($F$) can be comp
Publikováno v:
Communications in Computer and Information Science ISBN: 9783031180811
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b4fd0baf7720a85d2b5342f2ad9b86e0
https://doi.org/10.1007/978-3-031-18082-8_20
https://doi.org/10.1007/978-3-031-18082-8_20
Publikováno v:
Advances in Soft Computing ISBN: 9783030898199
MICAI (2)
MICAI (2)
In this paper, we present an algorithm to approximate the clique-width of a graph. The proposed approach is based on computing the shortest paths between pairs of vertices. We experimentally show that our proposal approximates the clique-width of sim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cfaad305905187f775b69fdf7ca64328
https://doi.org/10.1007/978-3-030-89820-5_27
https://doi.org/10.1007/978-3-030-89820-5_27
Autor:
J. Raymundo Marcial-Romero, A. Guzmán-Ponce, J.S. Sánchez-Garreta, Rosa María Valdovinos-Rosas
Publikováno v:
Repositori Universitat Jaume I
Universitat Jaume I
Universitat Jaume I
In many real-world problems (such as industrial applications, chemistry models, social network analysis, among others), their solution can be obtained by transforming the problem in terms of vertices and edges, that is to say, using graph theory. Dat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ed5e2761ae3cbaa36c6998402eaf5a4a
Publikováno v:
Advances in Soft Computing ISBN: 9783030608835
MICAI (1)
MICAI (1)
An \(O(m+n)\) time algorithm is presented for counting the number of models of a two Conjunctive Normal Form Boolean Formula whose constrained graph is represented by a Series-Parallel graph, where n is the number of variables and m is the number of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb0b79cef96c909a26444349739ac412
https://doi.org/10.1007/978-3-030-60884-2_33
https://doi.org/10.1007/978-3-030-60884-2_33