Algorithms Complexity
Mostrando 13-24 de 120 artigos, teses e dissertações.
-
13. Aplicação de redes neurais artificiais no processo de ajuste de histórico / Application of artificial neural networks in the history matching process
The history matching process is one of the most important stages involving studies of reservoirs, because with the adjusted reservoir model, the production forecasts can be done with higher reliability and different production strategies can be evaluated to obtain greater final recovery associated with less costs. However, this process have several problems
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 24/05/2012
-
14. Complexidade de construção de árvores PQR / Complexity of PQR tree construction
As árvores PQR são estruturas de dados usadas para tratar o problema dos uns consecutivos e problemas relacionados. Aplicações incluem reconhecimento de grafos de intervalos, de grafos planares, e problemas envolvendo moléculas de DNA. A presente dissertação busca consolidar o conhecimento sobre árvores PQR e, principalmente, sua construção increme
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 27/02/2012
-
15. Recuperação de vídeos comprimidos por conteúdo / Content-based retrieval of compressed videos
Recent advances in the technology have enabled the increase of the availability of video data, creating large digital video collections. This has spurred great interest in systems that are able to manage those data in a efficient way. Making efficient use of video information requires the development of powerful tools to extract high-level semantics from low
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 28/11/2011
-
16. 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
-
17. Uma aplicação de scheduling na indústria / The application of scheduling in the industry
This paper addresses the problem of sequencing jobs in the practical environment in the industry, which is considered more relevant aspects such as production in parallel, setup time, batch production and delivery date. Will also be considered some aspects of transport as the transport capacity, making the problem of atypical already studied in literature. T
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 27/05/2011
-
18. Diferenciação automática de matrizes Hessianas / Automatic differentiation of hessian matrices
In the context of nonlinear programming, many algorithms boil down to the application of Newton s method to the system constituted by the first order Lagrangian conditions. The calculation of Hessian matrices is necessary in this class of solvers. Our focus is on the exact calculation, within machine precision, of Hessian matrices through automatic different
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 15/04/2011
-
19. Optimization of laminated composite plates and shells using genetic algorithms, neural networks and finite elements
Structural optimization using computational tools has become a major research field in recent years. Methods commonly used in structural analysis and optimization may demand considerable computational cost, depending on the problem complexity. Therefore, many techniques have been evaluated in order to diminish such impact. Among these various techniques, Art
Latin American Journal of Solids and Structures. Publicado em: 2011
-
20. 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
-
21. Complexidade computacional e o problema P vs NP / Computational complexity and the P vs NP problem
A teoria de complexidade computacional procura estabelecer limites para a eficiência dos algoritmos, investigando a dificuldade inerente dos problemas computacionais. O problema P vs NP é uma questão central em complexidade computacional. Informalmente, ele procura determinar se, para uma classe importante de problemas computacionais, a busca exaustiva po
Publicado em: 2010
-
22. Análise formal da complexidade de algoritmos genéticos / Formal analysis of genetic algorithms complexity
O objetivo do trabalho é estudar a viabilidade de tratar problemas de otimização, considerados intratáveis, através de Algoritmos Genéticos, desenvolvendo critérios para a avaliação qualitativa de um Algoritmo Genético. Dentro deste tema, abordam-se estudos sobre complexidade, classes de problemas, análise e desenvolvimento de algoritmos e Algorit
Publicado em: 2010
-
23. 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
-
24. O problema do k-Servidor / The k-server problem
In this work we study the k-server problem. In this problem, we have k servers on a metric space that must attend a sequence of requests with the goal of minimizing the total distance moved by the servers. We dedicate special attention to the k-server conjecture: any metric space allows for a k-competitive k-server algorithm. This is one of the most importan
Publicado em: 2010