A5003753544- Artificial Intelligence in Games
- Metaheuristic Optimization Algorithms Research
- Constraint Satisfaction and Optimization
- Digital Games and Media
- Evolutionary Algorithms and Applications
- Logic, programming, and type systems
- Logic, Reasoning, and Knowledge
- Educational Games and Gamification
- Scheduling and Optimization Algorithms
- Optimization and Packing Problems
- Advanced Multi-Objective Optimization Algorithms
- Reinforcement Learning in Robotics
- Formal Methods in Verification
- Semantic Web and Ontologies
- Data Management and Algorithms
- Vehicle Routing Optimization Methods
- Advanced Manufacturing and Logistics Optimization
- Video Analysis and Summarization
- Product Development and Customization
- Advanced Database Systems and Queries
- E-Learning and Knowledge Management
- Algorithms and Data Compression
- Scheduling and Timetabling Solutions
- Manufacturing Process and Optimization
- Model-Driven Software Engineering Techniques
Universidad de Málaga
2012-2023
Software (Spain)
2019-2023
Puigvert Foundation
2017
Hospital Juan Ramón Jiménez
1999-2012
Universitat Politècnica de Catalunya
2008
Conventional approaches to crossover apply the operator only once on selected pair of parents, create precisely two offspring. Multiple Crossover Per Couple (MCPC) is an alternative, recently proposed (S. Esquivel et al., 1995), approach under which more than one operation for each mating allowed. The paper shows empirical results obtained with genetic algorithms allowing MCPC when searching minimum global values a set hard functions.
Neck disorders have a significant impact on people because of their high incidence. The head-mounted display (HMD) systems, such as Meta Quest 2, grant access to immersive virtual reality (iRV) experiences. This study aims validate the 2 HMD system an alternative for screening neck movement in healthy people. device provides data about position and orientation head and, thus, mobility around three anatomical axes. authors develop VR application that solicits participants perform six...
Computational devices with significant computing power are pervasive yet often under-exploited since they frequently idle or performing non-demanding tasks. Exploiting this can be a cost-effective solution for solving complex computational Device-wise, some times comprise stable, long-lasting availability windows but it will more take the form of brief, ephemeral bursts, mainly in presence “lent” voluntarily by their users. A highly dynamic and volatile landscape emerges from collective...
Abstract In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains ( CFLP $\fd$ )) with a lazy functional logic programming language which seamlessly embodies finite domain ) constraints. This increases the expressiveness and power of constraint domains CLP by combining relational notation, curried expressions, higher-order functions, patterns, partial applications, non-determinism, evaluation, logical variables, types, composition, We describe...
Abstract The tool switching problem (ToSP) is well known in the domain of flexible manufacturing systems. Given a reconfigurable machine, ToSP amounts to scheduling collection jobs on this machine (each them requiring different set tools be completed), as loaded/unloaded at each step process these jobs, such that total number switches minimized. Different exact and heuristic methods have been defined deal with problem. In work, we focus memetic approaches To end, considered variants three...
Finding binary sequences with low auto correlation is a very hard problem many practical applications. In this paper we analyze several meta heuristic approaches to tackle the construction of kind sequences. We focus on two different local search strategies, steepest descent (SDLS) and tabu (TS), their use both as stand-alone techniques embedded within memetic algorithm (MA). Plain evolutionary algorithms are shown perform worse than strategies. However, MA endowed TS turns out be...