Archives for 

Research Projects

Algorithms, Combinatorics and Applications

Algorithms are the most fundamental concept of Computer Science. His study refers to basic theories such as Computational Complexity and Computability. On the other hand, the algorithm design, along with all its paradigms – sequential, parallel, distributed, randomized, approximate, quantum algorithms, among others – allows the computer to solve problems in the most diverse fields […] Continue reading →

Computational Modeling Applied to Problems of Science and Engineering

The present project aims at the development of computationally efficient models for simulation of problems in the areas of Sciences and Engineering. The computational cost reduction in these problems will be obtained by the use of optimization techniques, adaptive approaches and high performance. The first group of techniques involves the representation of the problem through […] Continue reading →

Methods in Adaptive Networks

The theory of adaptive networks encompasses problems related to aggregation, learning, optimization, node localization, adaptive processing, and the diffusion of information across distributed systems. The understanding and inference of the emergence of sophisticated patterns of behavior, learning, processing from the limited interactions between agents belonging to a network allows the understanding of several non-trivial properties […] Continue reading →

Theory of Graphs and their Applications

Several real-life problems can be modeled from the perspective of Graph Theory or Network Science. The problems of interest of the researchers of this project are those that lie on the border between Discrete Mathematics, Computer Science, Linear Algebra and Optimization. Some problems of interest are clustering problems, network reliability, spectral theory in graphs and […] Continue reading →