Buscar
Mostrando ítems 61-70 de 445
Molecular distance geometry methods: from continuous to discrete
(Wiley-blackwellMaldenEUA, 2011)
SITUALIZ: Situational planning simulation software: SITUALIZ: Software para la simulación de planes situacionalesSITUALIZ: Software para la simulación de planes situacionales: SITUALIZ: Situational planning simulation software
(Facultad Experimental de Ciencias de la Universidad del Zulia, 2018)
Aplicação de operadores de crossover no Search Group Algorithm para otimização de treliças planas
(Florianópolis, SC., 2022-09-08)
A utilização de métodos de otimização computacional na engenharia estrutural é relativamente
recente e, cada vez mais, busca-se entregar resultados melhores em uma escala de tempo
competitiva. Nesse contexto, este trabalho ...
Bog: A New Approach For Graph Matching
(Institute of Electrical and Electronics Engineers Inc., 2014)
Topological synthesis of planar metamorphic mechanisms for low-voltage circuit breakers
(Taylor, 2012-10)
This article presents a systematic graph theory-based method for the topological synthesis of planar metamorphic mechanisms including metamorphic transformations of links and changes in the degrees-of-freedom. The parts ...
Optimal selection of conductors in distribution systems using tabu search algorithm [Selección óptima de conductores en sistemas de distribución empleando el algoritmo búsqueda tabú]
(Universidad de Tarapaca, 2018)
An efficient methodology for the optimal selection of conductor in distribution systems through the implementation of the metaheuristic optimization technique called Tabu Search is presented in this paper. To represent the ...
A stochastic algorithm for solving mazesUn algoritmo estocástico para resolver laberintos
(Universidad de Costa Rica, Centro de Investigación en Matemática Pura y Aplicada (CIMPA), 2019)
Feline: um método de indexação para consultas de alcançabilidade em grandes grafos estáticos e dinâmicos
(Universidade Federal de Minas GeraisUFMG, 2015-07-17)
A key problem in many applications based on directed graphs is the need to quickly know if there is a path between two given vertices u and v, i.e., if u reaches v, which is termed reachability query. This problem is ...
COMPARING A NOVEL QOS ROUTING ALGORITHM TO STANDARD
(2010-11-19)
The problem of finding QoS paths involving several
combinations of network metrics is NP-complete. This
motivates the use of heuristic approaches for finding
feasible QoS paths. Many constraint based routing
algorithms ...