Spanning tree
Efficient and accurate construction of genetic linkage maps from the minimum spanning tree of a graph.
... Most of the algorithms proposed in the literature for genetic linkage mapping find reasonably good solutions. Nonetheless, they fail to identify and exploit the combinatorial structures hidden in the data. Some of them ...
11
A Hybrid Algorithm Based on Memetic Algorithm and Tabu Search for k-Minimum Spanning Tree Problems
... Tables I-X show the results of experiments for several benchmark instances. |V |, |E| indicate the number of vertices and edges of graph G and k denotes the number of edges that the k-spanning tree contains ...
6
Branch-and-Cut and GRASP with Hybrid Local Search for the Multi-Level Capacitated Minimum Spanning Tree Problem
... We propose efficient algorithms to compute tight lower bounds and high quality upper bounds for the Multi-Level Capacitated Minimum Spanning Tree problem. We first develop a branch-and- cut algorithm for ...
5
New genetic algorithm approach for the min-degree constrained minimum spanning tree
... A different chromosome representation involves using a set of randomly se- lected leaves. In this case, an array of bits is used to represent the edges in the set. For this version, we need to modify KA in order to avoid ...
31
Vertical Handoff Using the Application of Spanning Tree in 4 G
... According to the scenario the communication on mobile is very important in today life. Today the person can handle any task through talking on mobile with present one place. Than according to this reason the service ...
4
Constructing Minimal Spanning Tree Based on Rough Set Theory for Gene Selection
... directed spanning tree is defined as a graph which connects, without any cycle, all vertices with n-1 edges, ...minimal spanning tree MST(V, S) of the graph G(V, E) where S is a subset of E ...
15
Formulações e algoritmos baseados em programação linear inteira para o problema quadrático da árvore geradora mínima = Formulations and algorithms based on linear integer programming for the quadratic minimum spanning tree problem.
... Initial valid QMSTP upper bounds are obtained by means of the following multi-start heuristic. We first randomly select an initial spanning tree T of G and then apply local search. The latter is implemented ...
117
Estudo de utilização de uma minimum spanning tree de correlações como seletora de ações em uma estratégia de cointegração no mercado brasileiro
... Pulando o caso 2 que será analisado em seguida, para o caso 3 (tabela 4), agregando todos os ativos que pertencem ao mesmo setor de atuação e considerando todo[r] ...
41
ENERGY EFFICENT ROUTING PROTOCOL IN WIRELESS SENSOR NETWORK
... each tree node to avoid the situation that a node will be connected with many other nodes ...minimum spanning trees. This tree formation algorithm starts with the cluster ...all tree nodes ...
6
Métodos heurísticos aplicados ao problema da árvore de Steiner rectilinear
... Minimum Tree Problem - SMTP), de modo similar ao problema da árvore geradora mínima (Minimum Spanning Tree Problem - MSTP), consiste em: dado um conjunto P de pontos no plano cartesiano, ...
60
Ant colony algorithms for multiple objective combinatorial optimization: applications to the minimum spanning trees problems
... (Spanning Tree Protocol ...The Spanning Tree Protocol configures a spanning tree structure accessed by each bridge or router, which is the only way that traffic can be sent to ...
308
First insight into the genotypic diversity of clinical Mycobacterium tuberculosis isolates from Gansu Province, China.
... In Figure 2, the clustering is shown in the form of a minimum spanning tree. The Beijing family isolates form the largest pink group, whereas the other main two groups shown in green and blue (called ...
9
A MULTI-POPULATION GENETIC ALGORITHM FOR TREE-SHAPED NETWORK DESIGN PROBLEMS
... There are many applications where it is necessary to find an optimal spanning tree. In the minimum span- ning tree (MST) one wishes to find a least-cost tree spanning all vertices in a ...
6
Construction of FP Tree using Huffman Coding
... This paper proposes a novel frequent pattern tree structure based on an efficient FP-tree-based mining method: i.e FP-growth. This approach is more efficient due to compression of large database into ...
4
PROTOCOLOS DE COLETA DE DADOS PARA REDES DE SENSORES SEM FIO
... Collection Tree Protocol (XCTP) que melhora o Collection Tree Protocol (CTP), uti- lizado para coleta de dados em RSSF, criando caminhos bidirecionais entre as estações base e os nós sensores da rede, ...
129
Cryptic Genetic Diversity Is Paramount in Small-Bodied Amphibians of the Genus Euparkerella (Anura: Craugastoridae) Endemic to the Brazilian Atlantic Forest
... calibration points (e. g., fossil records, biogeographic events) for the studied group prevents the application of an alternative approach. Although divergence times should be interpreted with caution, we consider the ...
12
Enhancing the Performance of Entropy Algorithm using Minimum Tree in Decision Tree Classifier
... the tree depends on the sequence in which the dataset attributes is used to build the ...minimum tree because the minimum tree needs the shortest time to figure out the outcome of the ...minimum ...
3
Evolutionary model tree induction
... Model tree A has an error rate of 0.7 while model tree B has one of ...model tree A would be selected as the optimal solution. However, model tree A has 79 leaf nodes (and thus 79 linear ...
84
UNIVERSIDADE FEDERAL DE UBERLÂNDIA
... Nos experimentos a seguir, as curvas referentes à construção do método de acesso sequencial (Seq Scan) representam a leitura da base de dados, serialização dos objetos e armazenamento em um arquivo sequencial com páginas ...
48
Population genetic structure in Fennoscandian landrace rye (Secale cereale L.) spanning 350 years
... unique material consisting of rye dating to the seventeenth century, rye from nineteenth century straw decorations and grains from nineteenth and early twentieth century seed collections[r] ...
13