Upload resources

Upload your works to SEDICI to increase its visibility and improve its impact

 

A criteria to select genetic operators for solving CSP

Document type: Articulo

Abstract

Our 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.

General information

Issue date: 2000
Document language: English
Journal: Journal of Computer Science & Technology; vol. 1, no. 2
Origin: Facultad de Informática
ISSN: 1666-6038

Download Files

Thumbnail
Documento completo
Download file (442.7Kb) - PDF
Icon
External link
 
Created: 6 de mayo de 2004
Available since: 6 de mayo de 2004
Please, use one of this identificators(URI) for cite o linking this item:
  • http://sedici.unlp.edu.ar/handle/10915/9386

    • This item appears in the following Collection(s)

    Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0) Except where otherwise noted, this item's license is described as Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)