Examinando por Autor "Yuste Moure, Javier"

Mostrando 1 - 2 de 2

EDUCAWORDLE: Desarrollo de una herramienta de aprendizaje de conceptos clave en el aula
(2025-07-10) González de Lena Alonso, María Teresa; Sánchez Calle, Ángel; Buenaposada Biencinto, José Miguel; García Pardo, Eduardo; Moreno Díaz, Ana Belén; Vélez Serrano, José Francisco; Ruiz Parrado, Victoria; Cavero Díaz, Sergio; Yuste Moure, Javier; Robles Rodríguez, Marcos; Barreiro Garrido, Álvaro
La gamificación en el ámbito educativo ha demostrado ser una estrategia efectiva para mejorar la motivación y el aprendizaje de los estudiantes. Sin embargo, muchas herramientas educativas actuales carecen de la flexibilidad necesaria para que los profesores puedan adaptar el contenido a sus temarios específicos. En este contexto, el presente trabajo tiene como objetivo principal desarrollar una aplicación web educativa basada en la mecánica del popular juego Wordle, que permita a los profesores crear partidas personalizadas con vocabulario específico de sus asignaturas. Como resultado, se ha desarrollado una aplicación web completamente funcional que incluye un panel de administración para profesores donde pueden crear y gestionar partidas con vocabulario personalizado, un sistema de autenticación, una interfaz de juego que replica la mecánica de Wordle, y un sistema de estadísticas que permite el seguimiento del progreso de los estudiantes.
Heuristic Algorithms for the Optimization of Software Quality
(Universidad Rey Juan Carlos, 2024) Yuste Moure, Javier
Software quality is of utmost importance for the correct functioning of modern systems. The quality of software projects is measured by different attributes, such as efficiency, security, or understandability, among others. Without a proper design, the code becomes prone to errors and unsatisfactory. In this doctoral thesis, we study the optimization of software quality. In particular, we focus on the optimization of software maintainability, which is critical to the long-term success of software projects. The subject studied is known as the Software Module Clustering Problem, which is a well-known family of optimization problems in the area of Search-Based Software Engineering. We study four of these problems based on different quality metrics used to evaluate software systems. Two of them, Modularization Quality and Function of Complexity Balance, are studied as mono-objective problems. The other two problems, Maximizing Cluster Approach and Equal-size Cluster Approach, consider multiple quality metrics and are studied as multi-objective optimization problems. Given the complexity of these problems, which have been proven to be NP-complete, exact methods are impractical for the size of real-world software projects. Therefore, this doctoral thesis focuses on approximate methods. In particular, the use of three metaheuristic procedures is proposed: a Greedy-Randomized Adaptive Search Procedure combined with Variable Neighborhood Descent, a General Variable Neighborhood Search, and a Multi-Objective General Variable Neighborhood Search. To improve the efficiency of the aforementioned methods, several novel strategies are introduced, and an exhaustive study of neighborhood structures and their exploration is performed. Finally, the proposed methods have been validated by favorably comparing their performance with the best algorithms available in the related literature, on a dataset obtained from real software instances. The significance of the results obtained is supported by statistical tests.