CV Lattes
Universidade Estadual de Campinas (UNICAMP). Instituto de Computação (IC) (Institutional affiliation for the last research proposal) Birthplace: Brazil
bachelor's at Bacharelado em Ciência da Computação from Universidade Estadual de Campinas (2012) and master's at Computer Science from Universidade Estadual de Campinas (2014). Has experience in Computer Science, acting on the following subjects: otimização combinatória, problema do recorte com custo nas conversões, geometria computacional, heurística and problema do posicionamento de antenas. (Source: Lattes Curriculum)
| News published in Agência FAPESP Newsletter about the researcher |
| TITULO |
| Articles published in other media outlets (0 total): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |
Will be realized a geometric and algorithmic study of a variation of the Art Gallery Problem, known as the Wireless Location Problem. In this problem is given a simple polygon and we want to position antennas such that, for any point in the plane, it is possible to determine whether it is inside or outside the polygon based on the signals received from the antennas.
This Scientific Initiation project aims to study the Milling Tour Problem with Turn Costs (MTTC), and create a heuristic for one of its variants known as the Discrete Orthogonal Milling Problem (ODMP). In this problem, we wish to find a close curve that covers all points of a rectilinear polygon when it is traversed by an object of rectangular shape and minimize the cost of conversions pe…
The Wireless Localization Problem is a variation of the classical art gallery problem, that deals with the placement of the smallest number of broadcasting antennas required to satisfy some property with respect to a given polygon. Each antenna that is installed must propagate a unique key within a certain specific angle of broadcast in a such a way that the set of keys received at any gi…
| 2 / 2 | Completed scholarships in Brazil |
| 1 / 1 | Completed scholarships abroad |
| 3 / 3 | All Scholarships |
| Associated processes | |