Approximate Algorithms
Mostrando 1-12 de 29 artigos, teses e dissertações.
-
1. Evolving granular systems = : Sistemas granulares evolutivos / Sistemas granulares evolutivos
In recent years there has been increasing interest in computational modeling approaches to deal with real-world data streams. Methods and algorithms have been proposed to uncover meaningful knowledge from very large (often unbounded) data sets in principle with no apparent value. This thesis introduces a framework for evolving granular modeling of uncertain
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 19/07/2012
-
2. 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
-
3. Soluções aproximadas para algoritmos escaláveis de mineração de dados em domínios de dados complexos usando GPGPU / On approximate solutions to scalable data mining algorithms for complex data problems using GPGPU
The increasing availability of data in diverse domains has created a necessity to develop techniques and methods to discover knowledge from huge volumes of complex data, motivating many research works in databases, data mining and information retrieval communities. Recent studies have suggested that searching in complex data is an interesting research field
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 22/09/2011
-
4. Inclusão de MRI e informação multigrid a priori para inferência bayesiana de fontes de M/EEG / MRI image and multigrid a priori information for bayesian M/EEG source localization
Functional Neuroimaging has evolved in the last few decades with the introduction of techniques such as Positron Emission Tomography or PET and Functional Magnetic Ressonance Image or fMRI [Belliveau et al., 1991]. These allow observing brain activity with a resolution of a few millimeters and, due to the nature of the signal, a time resolution of the order
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 28/04/2011
-
5. 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
-
6. Projeto de filtros tipo "só-pólo" para malhas de sincronismo de fase de alta frequência. / Design of all-pole filters for high frequency phase locked loops.
The evolution of communication systems is discussed, with emphasis on optical technology. Special consideration is given to the continuous need for increasing the capacity of such systems, and the impact over future optical communication. In view of the great demands imposed over the capacity of future optical systems, an overview is presented of two recent
Publicado em: 2010
-
7. Combinação de modelos de campos aleatórios markovianos para classificação contextual de imagens multiespectrais / Combining markov random field models for multispectral image contextual classification
This work presents a novel MAP-MRF approach for multispectral image contextual classification by combining higher-order Markov Random Field models. The statistical modeling follows the Bayesian paradigm, with the definition of a multispectral Gaussian Markov Random Field model for the observations and a Potts MRF model to represent the a priori knowledge. In
Publicado em: 2010
-
8. Sequential optimality conditions / Condições sequenciais de otimalidade
We study optimality conditions generated by the external penalty, internal penalty, internal-external penalty and inexact restoration algorithms, and we show relations with the CPLD, a new constraint qualification strictly weaker than the Mangasarian-Fromovitz condition and the constant rank condition of Janin. We extend the result of the classical Carathéo
Publicado em: 2009
-
9. MÃtodo adaptativo de Markov Chain Monte Carlo para manipulaÃÃo de modelos Bayesianos
Historically, Bayesian models have deserved special attention from academy and applied fields mainly by allowing mathematical combination of human judgments and empirical data. Markov Chain Monte Carlo (MCMC) methodology is one of the main classes of approaches for computing marginal estimates from Bayesian models. Among Markov Chain Monte Carlo methods, Met
Publicado em: 2009
-
10. Hibridização de algoritmos genéticos e sistemas imunológicos artificiais para problemas de otimizacão com restricões em engenharia / HYBRIDIZATION OF GENETIC ALGORITHMS AND ARTIFICIAL IMMUNE SYSTEMS FOR CONSTRAINED OPTIMIZATION PROBLEMS IN ENGINEERING
In this work some possibilities of hibridization of genetic algorithms and artificial immune systems are proposed, computationally implemented, and tested in order to solve constrained optimization problems. Such problems arise frequently in the computational modeling of relevant scientific and technological problems. After a brief formulation and solution c
Publicado em: 2008
-
11. Filtros para a busca e extração de padrões aproximados em cadeias biológicas / Filter Algorithms for Approximate Patterns Matching and Extraction from Biological Strings
Esta dissertação de mestrado aborda formulações computacionais e algoritmos para a busca e extração de padrões em cadeias biológicas. Em particular, o presente texto concentra-se nos dois problemas a seguir, considerando-os sob as distâncias de Hamming e Levenshtein: a) como determinar os locais nos quais um dado padrão ocorre de modo aproximado em
Publicado em: 2008
-
12. Comparison of algorithms used in the construction of genetic linkage maps / Comparação de algoritmos usados na construção de mapas genéticos
Genetic linkage maps are linear arrangements showing the order and distance between loci in chromosomes of a particular species. Recently, the availability of molecular markers has made such maps more saturated and efficient methods are needed for their construction. One of the steps that deserves more attention in the construction of genetic linkage maps is
Publicado em: 2008