Algorithms On Graphs
Mostrando 1-12 de 33 artigos, teses e dissertações.
-
1. Aproximação de métricas finitas por métricas arbóreas e aplicações / Approximation of finite metrics by tree metrics and applications
Many optimization problems on graphs, especially metric problems, are easier to solve on trees. Therefore, a strategy for obtaining a good algorithm for certain problems is to obtain a tree that approximates the graph, and use a solution of the problem on the tree as an approximate solution for the problem on the original graph. We study the work of Fakcharo
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 15/12/2011
-
2. Data mining in large sets of complex data / Mineração de dados em grande conjuntos de dados complexos
Due to the increasing amount and complexity of the data stored in the enterprises\ databases, the task of knowledge discovery is nowadays vital to support strategic decisions. However, the mining techniques used in the process usually have high computational costs that come from the need to explore several alternative solutions, in different combinations, to
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 29/08/2011
-
3. Problemas em grafos com poucos P4 s em grafos indiferença / Problems on graphs with few P4 s and indifference graphs
Nesta tese de doutoramento sáo considerados três problemas em grafos, para os quais sáo obtidos resultados quando a entrada é restrita a algumas classes. Todos os problemas sáo problemas de otimização combinatória sobre grafos simples e apresentam diferentes classificações de complexidade. Em dois casos, o estudo focou classes de grafos com "poucos
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 19/08/2011
-
4. O impacto do reordenamento de matrizes esparsas nos métodos iterativos não estacionários precondicionados
A análise da influência dos algoritmos de reordenamento de matrizes na resolução de sistemas lineares utilizando os mmétodos iterativos não estacionários GMRES e Gradiente Conjugado, ambos com e sem precondicionamento, é o objeto de estudo desse trabalho. Os algoritmos mais referenciados na literatura para reordenamento de matrizes são Reverse Cuthi
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 13/07/2011
-
5. Aplicação de modelos de Markov ocultos na obtenção de taxas de mortalidade das larvas do mosquito da Dengue
In order to prevent the proliferation of Dengue transmitter - scientifically named as Aedes ae- gypti - and therefore decrease human contamination by such insect, many larvaecides have been developed recently. Researchers from Dom Bosco Catholic University evaluate the efectiveness of vegetal-derived substances capable to combat such animal larvae. Death rat
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 26/02/2010
-
6. Análise,Simulações e Aplicações Algorítmicas de Caminhadas Quânticas / Analysis,Simulations and Algorithmic Applications of Quantum Walks
Quantum computing is a model of computation based on the laws of quantum mechanics, which can be used to develop faster algorithms. The development of efficient quantum algorithms, however, is a highly challenging task. A recent successful approach is the use of quantum walks. In this work, we have studied the quantum walk on the hypercube, obtaining the exa
Publicado em: 2010
-
7. Algoritmos para escalonamento de tarefas dependentes representadas por grafos acíclicos direcionados em grades computacionais / Scheduling algorithms for dependent tasks represented by directed acyclic graphs on computational grids
Computational grids are potentially large distributed systems composed of heterogeneous resources connected by a network with heterogeneous links. These systems became largely used in the execution of tasks which require large processing capacities. Because they are shared systems, task submission in grids independently originate from a number of users, lead
Publicado em: 2010
-
8. Algoritmo de roteamento Anycast baseado em algoritmos genéticos para redes tolerantes a atrasos e desconexões / Anycast Routing Algorithm Based on Genetic Algorithms for Delay and Disruption Tolerant Networks
DTNs (Delay and Disruption Tolerant Networks) have the potential to interconnect devices and areas of the world that are underserved by traditional networks. The development of these networks can lead to the revolution of the technology information for the population in developing countries which lack infrastructure, especially in remote and rural regions. I
Publicado em: 2010
-
9. Estruturas de dados eficientes para algoritmos evolutivos aplicados a projeto de redes / Efficient Data Structures to Evolutionary Algorithms Applied to Network Design Problems.
Network design problems (NDPs) are very important since they involve several applications from areas of Engineering and Sciences. In order to solve the limitations of traditional algorithms for NDPs that involve real world complex networks (in general, modeled by large-scale complete or sparse graphs), heuristics, such as evolutionary algorithms (EAs), have
Publicado em: 2009
-
10. O metodo de geração de colunas aplicado a problemas de otimização em grafos / Column generation technique applied to graph optimization problems
In this thesis, two combinatorial optimization problems are modeled by integer linear programming and solved using the column generation technique. Both cases correspond to generalizations of classical problems in graphs that occur in many practical situations. The first, called capacitated ring-star problem is a generalization of the vehicle routing problem
Publicado em: 2009
-
11. ChipCflow - uma ferramenta para execução de algoritmos utilizando o modelo a fluxo de dados dinâmico em hardware reconfigurável - operadores e grafos a fluxo de dados / ChipCflow - tool for implementing of algorithms using the dataflow model in dynamic reconfigurable hardware - Operators and the dataflow graphs
In order to convert C Language into hardware, a ChipCflow project, is a fundamental element to be used. In particular, dynamic dataflow architecture can be generated to produce a high level of parallelism to be executed into a partial reconfigurable hardware. Because of the complexity of the partial reconfigurable system, in this part of the project, a poof-
Publicado em: 2009
-
12. Algebraic formulation for modeling hop-by-hop multi-constrained routing algorithms. / Formulação algébrica para a modelagem de algoritmos de roteamento multi-restritivo hop-by-hop.
This work presents a new mathematical structure for paths algebra that allows the convergence analysis of hop-by-hop multi-constrained routing algorithms and, under the traffic engineering and quality of service perspectives in the Generalized Multiprotocol Label Switching (GMPLS) architecture, trustily ensures the aggregation of new routing metrics in a con
Publicado em: 2008