Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Leguizamón, Mario Guillermo"'
Autor:
Dorzán, María Gisela, Leguizamón, Mario Guillermo, Mezura Montes, Efrén, Hernández Peñalver, Gregorio, Díaz Báñez, José Miguel (Coordinador), Garijo Royo, Delia (Coordinador), Márquez Pérez, Alberto (Coordinador), Urrutia Galicia, Jorge (Coordinador)
Publikováno v:
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
instname
We focus on the development of approximated algorithms to find high quality triangulations of minimum dilation because the complexity status of the Minimum Dilation Triangulation problem for a general point set is unknown. We propose an operator to g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a0be187b239c56ca8ef2641d3b7f1848
https://idus.us.es/handle/11441/60021
https://idus.us.es/handle/11441/60021
Autor:
Gagliardi, Edilma Olinda, Leguizamón, Mario Guillermo, Hernández Peñalver, Gregorio, Díaz Báñez, José Miguel (Coordinador), Garijo Royo, Delia (Coordinador), Márquez Pérez, Alberto (Coordinador), Urrutia Galicia, Jorge (Coordinador)
Publikováno v:
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
instname
The Minimum Weight Pseudo-Triangulation (MWPT) problem is suspected to be NP-hard. We show here how Simulated Annealing (SA) can be applied for obtaining approximate solutions to the optimal ones. To do that, we applied two SA algorithms, the basic v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a333210ae1a31a23709f6b0a4d91b593
https://idus.us.es/handle/11441/60128
https://idus.us.es/handle/11441/60128
Publikováno v:
Journal of Computer Science and Technology, Vol 5, Iss 04, Pp 264-271 (2005)
SEDICI (UNLP)
Universidad Nacional de La Plata
instacron:UNLP
SEDICI (UNLP)
Universidad Nacional de La Plata
instacron:UNLP
Clustering task aims at the unsupervised classification of patterns (e.g., observations, data, vec- tors, etc.) in different groups. Clustering problem has been approached from different disciplines during the last years. Although have been proposed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::b30141d0f7af5f9b5f72dc50de0c3033
http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Dec05-16.pdf
http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Dec05-16.pdf
Publikováno v:
Journal of Computer Science and Technology, Vol 1, Iss 02, Pp 11 p.-11 p. (2000)
SEDICI (UNLP)
Universidad Nacional de La Plata
instacron:UNLP
SEDICI (UNLP)
Universidad Nacional de La Plata
instacron:UNLP
This paper presents an Ant Colony Optimisation (ACO) model for the Multiple Knapsack Problem (MKP). The ACO algorithms, as well as other evolutionary metaphors, are being applied successfully to diverse heavily constrained problems: Travelling Salesm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::1edf9c35b4e089887caa2f06e2c427b4
https://journal.info.unlp.edu.ar/JCST/article/view/1019
https://journal.info.unlp.edu.ar/JCST/article/view/1019
Autor:
Dorzán, Maria Gisela, Gagliardi, Edilma Olinda, Leguizamón, Mario Guillermo, Hernández Peñalver, Gregorio
Publikováno v:
Fundamenta Informaticae; 2012, Vol. 119 Issue 1, p1-27, 27p
Autor:
Dorzán, Maria Gisela, Gagliardi, Edilma Olinda, Leguizamón, Mario Guillermo, Peñalver, Gregorio Hernández
Publikováno v:
Journal of Computer Science & Technology (JCS&T); 2010, Vol. 10 Issue 2, p47-53, 7p, 2 Diagrams, 6 Charts, 4 Graphs
Autor:
Patricia Rosalia, Jimbo Santana
Publikováno v:
TDX (Tesis Doctorals en Xarxa)
Repositori Institucional de la Universitat Rovira i Virgili
Universitat Rovira i virgili (URV)
TDR. Tesis Doctorales en Red
instname
TDR: Tesis Doctorales en Red
CBUC, CESCA
SEDICI (UNLP)
Universidad Nacional de La Plata
instacron:UNLP
Repositori Institucional de la Universitat Rovira i Virgili
Universitat Rovira i virgili (URV)
TDR. Tesis Doctorales en Red
instname
TDR: Tesis Doctorales en Red
CBUC, CESCA
SEDICI (UNLP)
Universidad Nacional de La Plata
instacron:UNLP
El aporte central de esta tesis es la definición de un nuevo método capaz de generar un conjunto de reglas de clasificación difusas de fácil interpretación, baja cardinalidad y una buena precisión. Estas características ayudan a identificar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f8bd26d616704950290324d31576a019
https://doi.org/10.35537/10915/101163
https://doi.org/10.35537/10915/101163