Steiner Trees
Mostrando 1-4 de 4 artigos, teses e dissertações.
-
1. Maze routing steiner trees with delay versus wire length tradeoff
In this paper, we address the problem of generating good topologies of rectilinear Steiner trees using path search algorithms. Various techniques have been applied in order to achieve acceptable run times on a Maze Router that builds Steiner trees. A biasing technique proposed for wire length improvement, produces trees that are within 2% from optimal topolo
Publicado em: 2011
-
2. Árvores de Steiner: Teoria, Geração Numérica e Aplicações / Steiner trees: Theory, Numerical Generation and Applications
Given a set of points in the plane, which we call terminals, one proves that they are always connected by a minimal graph called Steiner tree. The terminals may represent main connection route points, circuit elements or network computer servers. That is, the problem is to optimize traffic among the terminals whenever this is represented by a tree of shortes
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 16/12/2009
-
3. Métodos heurísticos aplicados ao problema da árvore de Steiner rectilinear
Este trabalho apresenta uma nova heurística, denominada Heurística 1, e a implementação das metaheurísticas GRASP, Simulated Annealing e Algoritmos Genéticos para o problema da árvore retilínea mínima de Steiner (RSMTP), discorrendo sobre seus aspectos teóricos, como a complexidade computacional; e práticos, como pseudocódigos e estratégias de i
Publicado em: 2009
-
4. The Euclidean Steiner Ratio and the measure of chirality of biomacromolecules
The study of Euclidean Steiner Trees is one of the alternative methods to unveil Nature's plans for the internal architecture of biomacromolecules. Recently, the minimum surface structure of the A-DNA and of the Tobacco Mosaic Virus was shown to be described by a "strake" surface. These results have been substantiated by an explicit calculation of the Steine
Genetics and Molecular Biology. Publicado em: 2004