Algorithms Complexity
Mostrando 25-36 de 120 artigos, teses e dissertações.
-
25. Hardware/Software codesign of particle filter for real time localization of mobile robots / Co-projeto de hardware/software do filtro de partículas para localização em tempo real de robôs móveis
Sophisticated techniques for estimation of models based on simulation, particle filters or Sequential Monte Carlo Methods, were recently used to solve many difficult problems in the field of mobile robotics. However, the success of particle filters was limited to the computation of parameters in low dimensionality spaces. The current research efforts in mobi
Publicado em: 2010
-
26. Compulsory Flow Q-Learning: an RL algorithm for robot navigation based on partial-policy and macro-states
Reinforcement Learning is carried out on-line, through trial-and-error interactions of the agent with the environment, which can be very time consuming when considering robots. In this paper we contribute a new learning algorithm, CFQ-Learning, which uses macro-states, a low-resolution discretisation of the state space, and a partial-policy to get around obs
Journal of the Brazilian Computer Society. Publicado em: 2009-09
-
27. Proposta de integração entre tecnologias adaptativas e algoritmos genéticos. / Proposal for integration of adaptive technology and genetic algorithms.
This work is an initial study about the integration of two computing engineering areas, the adaptive technologies and the genetic algorithms. For that, it was per- formed the application of genetic algorithms for the adaptive automata inference. Several techniques were studied and proposed along the algorithm implementation, always seeking for more satisfyin
Publicado em: 2009
-
28. Services allocation in a metrology laboratory using genetic algorithms / Distribuição de serviços em laboratório de metrologia utilizando algoritmos genéticos
As simple as it might look, the problem of allocating a group of tasks to be executed with a limited number of available machines will always present a number of details and restrictions that in certain cases can result in a solution of great complexity. Some of the variables involved are: service priority, available raw materials, machinery or equipment cap
Publicado em: 2009
-
29. Codificação de vídeo : priorização do menor custo de codificação na otimização em taxa-distorção
This research work proposes two new video compression strategies, aiming at typical low bit rate video applications using rate-distortion (RD) optimized algorithms. The proposed strategies are implemented on an H.264 video encoder, which has high computational complexity due mainly to the large number of coding modes available. Two approaches are presented f
Publicado em: 2009
-
30. Busca meta-heurÃstica para resoluÃÃo de CSP em teste de software
The meta-heuristic search algorithms have been researched in several domains, including in constraint satisfaction problem. Due to its good adaptability to be used in problems where the actual solution is unknown, they are applied in innumerous contexts. The evolutive algorithms are a search algorithm family that simulates the nature behavior. The constraint
Publicado em: 2009
-
31. Geração genética de classificador fuzzy intervalar do tipo-2
The objective of this work is to study, expand and evaluate the use of interval type-2 fuzzy sets in the knowledge representation for fuzzy inference systems, specifically for fuzzy classifiers, as well as its automatic generation form data sets, by means of genetic algorithms. This work investigates the use of such sets focussing the issue of balance betwee
Publicado em: 2009
-
32. Técnicas de aumento de eficiência para metaheurísticas aplicadas a otimização global contínua e discreta / Efficiency--enhancement techniques for metaheuristics applied and continuous global optimization
Several real-world problems from various fields of Science and Engineering can be modeled as global optimization problems. In general, complex and large-scale problems can not be solved eficiently by exact techniques. In this context, Probabilistic algorithms, such as metaheuristics, have shown relevant results. Nevertheless, as the complexity of the problem
Publicado em: 2009
-
33. 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
-
34. 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
-
35. Uma arquitetura para o desenvolvimento de aplicações de visão computacional e processamento digital de imagens em sistemas embutidos
This paper describes an architecture of hardware and software that helps the development of applications of Computer Vision and Digital Image Processing in Embedded Systems, specically Smart Cameras. Smart Cameras are cameras that, in addition to image capturing, is capable of extracting application-specic information. Embedded systems are systems composed o
Publicado em: 2009
-
36. Análise e comparação entre algoritmos de percolação
Nesta dissertação estudamos e comparamos dois algoritmos de percolação, um elaborado por Elias e o outro por Newman e Ziff, utilizando ferramentas teóricas da complexidade de algoritmos e um algoritmo que efetuou uma comparação experimental. Dividimos este trabalho em três capítulos. O primeiro aborda algumas definições e teoremas necessári
Publicado em: 2008