Buscar
Mostrando ítems 601-610 de 1337
Comparación de estrategias para el diseño óptimo de instrumentación en plantas de procesoComparison of Strategies for the Optimal Instrumentation Design of Processing Plants
(Centro de Información Tecnológica, 2005-12)
En este trabajo se compara el desempeño de la estrategia determinística Branch y Bound y una estrategia estocástica basada en Algoritmos Genéticos para resolver el diseño de una red de sensores correspondiente al sistema ...
U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem
(ELSEVIER SCI LTD, 2010)
This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function ...
Placement over containers with fixed dimensions solved with adaptive neighborhood simulated annealing
(POLISH ACAD SCIENCES DIV IV, 2009)
This work deals with the problem of minimizing the waste of space that occurs on a rotational placement of a set of irregular bi-dimensional items inside a bi-dimensional container. This problem is approached with a heuristic ...
An alternative solution for the repair of electrical breakdowns after natural disasters based on ant colony optimization
(Universidad Nacional de Colombia Sede Medellín, 2014-08-26)
Abundant literature is available for the route planning based on meta-heuristic algorithms. However, most researches in this field are developed under normal scenarios (e.g. normal weather conditions). The natural disasters, ...
Aplicação de metaheurísticas para a solução do problema de programação de horários de irrigaçãoUsing metaheuristics for solving the irrigation timetabling problem
(Universidade Federal de ViçosaBRMetodologias e técnicas da Computação; Sistemas de ComputaçãoMestrado em Ciência da ComputaçãoUFV, 2015)
Metaheurísticas para o problema de Flowshop flexível com penalidades de adiantamento e atrasoMetaheuristics for the flexible Flowshop problem with earliness and tardiness penalties
(Universidade Federal de ViçosaBRMetodologias e técnicas da Computação; Sistemas de ComputaçãoMestrado em Ciência da ComputaçãoUFV, 2015)
Métodos para redução integrada do consumo de energia e do atraso na entrega de dados em Redes de Sensores Sem FioMethods for integrated reducing of energy consumption and delay in the delivery of data in Wireless Sensor Networks
(Universidade Federal de ViçosaBRMetodologias e técnicas da Computação; Sistemas de ComputaçãoMestrado em Ciência da ComputaçãoUFV, 2015)
Investigating molecular dynamics-guided lead optimization of EGFR inhibitors
(Pergamon-Elsevier Science Ltd, 2016-02-15)
The epidermal growth factor receptor (EGFR) is part of an extended family of proteins that together control aspects of cell growth and development, and thus a validated target for drug discovery. We explore in this work ...
Reducción en la complejidad computacional para problemas de optimización combinatoria mediante cómputo inteligente.
(2015-11-25)
Hoy en día el solucionar de forma óptima los problemas de combinatoria es un problema abierto. Determinar el mejor arreglo de los elementos en un conjunto resulta ser una tarea muy compleja que se vuelve crítica cuando el ...
Operating cost reduction in distribution networks based on the optimal phase-swapping including the costs of the working groups and energy losses
(Cartagena de Indias, 2021-07-27)
The problem of optimal phase-balancing in three-phase asymmetric distribution networks is addressed in this research from the point of view of combinatorial optimization using a master– slave optimization approach. The ...