Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Eduardo Olguín"'
Autor:
Stefanie Niklander, Fernando Paredes, Eduardo Olguín, Ricardo Soto, Franklin Johnson, Broderick Crawford, Rodrigo Olivares
Publikováno v:
Natural Computing. 16:241-257
Constraint programming is an efficient and powerful paradigm for solving constraint satisfaction and optimization problems. Under this paradigm, problems are modeled as a sequence of variables and a set of constraints. The variables have a non-empty
Publikováno v:
Proceedings of the 15th LACCEI International Multi-Conference for Engineering, Education, and Technology: “Global Partnership for Development and Engineering Education”.
The present article comprises the implementation of a Spectrometer in the range of visible light applicable specifically to the measurement of concentration of methanol in commercial alcoholic beverages. This device will have differentiating elements
Autor:
Broderick Crawford, Juan Salas, Eduardo Olguín, Sebastian Mansilla, Adrián Jaramillo, Álvaro Gómez, Ricardo Soto
Publikováno v:
2016 11th Iberian Conference on Information Systems and Technologies (CISTI).
The Soccer League Competition algorithm is a recently new approach to solve optimization problems using metaheuristic technique. It is based in the interaction between soccer players and teams, and the primary objective to win each match and become t
Publikováno v:
2016 11th Iberian Conference on Information Systems and Technologies (CISTI).
The Software project planning is one of the main problems that project managers are confronted as is the allocation of human resources to the activities to be performed to carry out a project. The purpose of this paper is to give an automated approac
Publikováno v:
2016 11th Iberian Conference on Information Systems and Technologies (CISTI).
The Set Covering Problem is a classical problem in combinatorial optimization that belongs to the Karp's 21 NP-hard problems, with many practical applications. In this paper, an approach based on Black Hole Algorithm is proposed to solve this problem
Publikováno v:
2016 11th Iberian Conference on Information Systems and Technologies (CISTI).
A nonogram corresponds to a puzzle game. The aim in this game is generating an image on a grid by checking certain cells, this cells have to satisfy some rules associated with each row and column. In this paper, genetic algorithms are used to solve t
Publikováno v:
2016 11th Iberian Conference on Information Systems and Technologies (CISTI).
Biogeography-Based Optimization Algorithm (BBOA) is a new kind of global optimization algorithm inspired by biogeography, which mimics the migration behavior of animals in nature to solve optimization and engineering problems. In this paper, we propo
Publikováno v:
2016 11th Iberian Conference on Information Systems and Technologies (CISTI).
Constraint programming is a powerful paradigm that allows for solving optimization and constraint satisfaction problems (CSPs). In this context, a main concern of this technology is that the efficient problem resolution usually relies on the employed
Autor:
Eduardo Olguín, Sebastian Mansilla, Álvaro Gómez, Adrián Jaramillo, Ricardo Soto, Broderick Crawford, Juan Salas
Publikováno v:
2016 11th Iberian Conference on Information Systems and Technologies (CISTI).
The Set Covering Problem (SCP) is one of the most representative combinatorial optimization problems and it has multiple applications in different situations of engineering, sciences and some other disciplines. It aims to find a set of solutions that
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783319336237
CSOC (1)
CSOC (1)
Due to the competitiveness of the software industry a more stressful tasks for software project managers allocation of the human resources to the different tasks that perform the project. This is not an easy task and it is necessary that is computati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc5e802aeca865b95824f84ed3c69289
https://doi.org/10.1007/978-3-319-33625-1_45
https://doi.org/10.1007/978-3-319-33625-1_45