Zobrazeno 1 - 10
of 134
pro vyhledávání: '"Casiano Rodríguez"'
Autor:
Juan-Manuel Ramos-Pérez, Gara Miranda, Eduardo Segredo, Coromoto León, Casiano Rodríguez-León
Publikováno v:
Mathematics, Vol 9, Iss 1, p 80 (2020)
A multi-objective formulation of the Menu Planning Problem, which is termed the Multi-objective Menu Planning Problem, is presented herein. Menu planning is of great interest in the health field due to the importance of proper nutrition in today’s
Externí odkaz:
https://doaj.org/article/baf10b1a5bcb4be5b3338ba6868f975f
Autor:
Rafael Herrero-Álvarez, Coromoto León, Gara Miranda, Casiano Rodríguez-León, Eduardo Segredo, Laura García, Yolanda Díaz
Publikováno v:
EDULEARN Proceedings.
Publikováno v:
IEEE Access, Vol 8, Pp 113200-113218 (2020)
SCHOOLTHY: Automatic Menu Planner for Healthy and Balanced School Meals is a decision support tool that addresses the multi-objective menu planning problem in order to automatically produce meal plans for school canteens. Malnutrition is a widespread
Autor:
Gara Miranda, Juan-Manuel Ramos-Pérez, Casiano Rodríguez-León, Eduardo Segredo, Coromoto León
Publikováno v:
Mathematics
Volume 9
Issue 1
Mathematics, Vol 9, Iss 80, p 80 (2021)
Volume 9
Issue 1
Mathematics, Vol 9, Iss 80, p 80 (2021)
A multi-objective formulation of the Menu Planning Problem, which is termed the Multi-objective Menu Planning Problem, is presented herein. Menu planning is of great interest in the health field due to the importance of proper nutrition in today&rsqu
Autor:
Jesús Alberto Gonzalez, Coromoto León, María Fabiana Piccoli, Alicia Marcela Printista, José Luis Roda García, Casiano Rodríguez, Francisco de Sande
Publikováno v:
Journal of Computer Science and Technology, Vol 1, Iss 03, Pp 11 p.-11 p. (2000)
The parallel computing model used in this paper, the Collective Computing Model (CCM), is a variant of the well-known Bulk Synchronous Parallel (BSP) model. The synchronicity imposed by the BSP model restricts the set of available algorithms and prev
Externí odkaz:
https://doaj.org/article/07c913be54794a6181e7799aff915228
Publikováno v:
Computer Science and Information Systems. 8:517-531
Though yacc-like LR parser generators provide ways to solve shift-reduce conflicts using token precedences, no mechanisms are provided for the resolution of difficult shift-reduce or reduce-reduce conflicts. To solve this kind of conflicts the langua
Publikováno v:
Optimization Techniques for Solving Complex Problems
Publikováno v:
Optimization Techniques for Solving Complex Problems
Publikováno v:
Optimization Techniques for Solving Complex Problems
Publikováno v:
Concurrency and Computation: Practice and Experience. 17:1173-1195