Mauro R. C. da Silva

According to our database, Mauro R. C. da Silva authored at least 6 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Approximation Algorithms for the MAXSPACE Advertisement Problem.

Lehilton L. C. Pedrosa, Mauro R. C. da Silva, Rafael C. S. Schouery

Theory Comput. Syst., June, 2024

2023

Positional Knapsack Problem: NP-hardness and approximation scheme (Brief Announcement).

Lehilton L. C. Pedrosa, Mauro R. C. da Silva, Rafael C. S. Schouery

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

Accelerating Fingerprint-based Person Identification through Computation Offloading in Edge and Cloud Environments.

Renan A. Barbosa, João P. B. Andrade, Mauro R. C. da Silva, Fernando A. M. Trinta, Paulo A. L. Rego

Proceedings of the 12th IEEE International Conference on Cloud Networking, 2023

2021

Acelerando a identificação de impressões digitais através da técnica de offloading computacional.

Renan A. Barbosa, João P. B. Andrade, Mauro R. C. da Silva, Francisco I. da S. Lima, Fernando A. M. Trinta, Paulo A. L. Rego

Proceedings of the 39th Brazilian Symposium on Computer Networks and Distributed Systems, 2021

2020

Local-Search Based Heuristics for Advertisement Scheduling.

Mauro R. C. da Silva, Rafael C. S. Schouery

CoRR, 2020

2019

A Polynomial-time Approximation Scheme for the MAXSPACE Advertisement Problem.

Mauro R. C. da Silva, Rafael C. S. Schouery, Lehilton L. C. Pedrosa

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019