dc.creatorRiff Rojas, María Cristina
dc.date2000
dc.date2004-05-06T03:00:00Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/9386
dc.identifierhttp://journal.info.unlp.edu.ar/wp-content/uploads/2015/papers_02/acriteria.pdf
dc.identifierissn:1666-6038
dc.descriptionOur interest is to define evolutionary algorithms to solve Constraint Satisfaction Problems (CSP), which indlude benefits of taditional resolution methods of CSPs as well as inherent characteristics of these kind of problems. In this paper we propose a criterion to be able to evaluate the perfomance of genetic operators within evolutionary algorithms that solve CSp.
dc.descriptionFacultad de Informática
dc.formatapplication/pdf
dc.languageen
dc.relationJournal of Computer Science & Technology
dc.relationvol. 1, no. 2
dc.rightshttp://creativecommons.org/licenses/by-nc/3.0/
dc.rightsCreative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)
dc.subjectCiencias Informáticas
dc.titleA criteria to select genetic operators for solving CSP
dc.typeArticulo
dc.typeArticulo


Este ítem pertenece a la siguiente institución