This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we reso...
Michael R. Fellows, Bart M. P. Jansen, Daniel Loks...
Designing concurrent or distributed systems with complex architectures while preserving a set of high-level requirements through all design steps is not a trivial task. Building up...
Real-time high-definition video encoding is a computationhungry task that challenges software-based solutions. For that, in this work we adopted an Intel software implementation o...
Tiago A. da Fonseca, Ricardo L. de Queiroz, Debarg...
The current challenge for crowd simulations is the design and development of a scalable system that is capable of simulating the individual behavior of millions of complex agents ...