GRASP-Evolution for Constraint Satisfaction Problems ABSTRACT (2009)
Manuel Cebrián, Escuela Politécnica
There are several evolutionary approaches for solving random binary Constraint Satisfaction Problems (CSPs). In most of these strategies we find a complex use of information regarding the problem at...
Grammatical Evolution with Restarts for Fast Fractal Generation (2008)
Manuel Cebrián, Manuel Alfonseca, Alfonso Ortega
In a previous work, the authors proposed a Grammatical Evolution algorithm to automatically generate Lindenmayer Systems which represent fractal curves with a pre-determined fractal dimension. This...
GRASP-Evolution for Constraint Satisfaction Problems ABSTRACT (2008)
Manuel Cebrián, Escuela Politécnica
There are several evolutionary approaches for solving random binary Constraint Satisfaction Problems (CSPs). In most of these strategies we find a complex use of information regarding the problem at...
Manuel Cebrián, Manuel Alfonseca, Alfonso Ortega
Abstract — Student plagiarism is a major problem in universities worldwide. In this letter, we focus on plagiarism in answers to computer programming assignments, where students mix and/or modify...
Ballestero , Cristóbal, Barroso , Julio, Cabero , Julio, Castaño , Carlos, Cebrián , Manuel, Gisbert , Mercé, ...
El documento que presentamos, es una síntesis de una propuesta que presentamos al Ministerio de Educación español, y se acoge a la línea de trabajo sobre «el proceso de aprendizaje en el marco...
Redundant Modeling for the QUasigroup Completion Problem (2003)
Iván Dotú, Alvaro Del Val, Manuel Cebrián
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint programming. [5]...
M.: Channeling Constraints and Value Ordering in the Quasigroup Completion Problem (2003)
Iván Dotú, Alvaro Del Val, Manuel Cebrián
The Quasigroup Completion Problem (QCP) is a very challenging
Redundant Modeling for the QUasigroup Completion Problem (2003)
Iván Dotú, Alvaro Del Val, Manuel Cebrián
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint programming. [5]...
M.: Channeling Constraints and Value Ordering in the Quasigroup Completion Problem (2003)
Iván Dotú, Alvaro Del Val, Manuel Cebrián
The Quasigroup Completion Problem (QCP) is a very challenging