Sciweavers

5832 search results - page 684 / 1167
» Software complexity and maintainability
Sort
View
FSTTCS
2010
Springer
15 years 5 months ago
On extracting computations from propositional proofs (a survey)
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...
Pavel Pudlák
FSTTCS
2010
Springer
15 years 5 months ago
Determining the Winner of a Dodgson Election is Hard
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...
ICFEM
2010
Springer
15 years 5 months ago
Reasoning about Safety and Progress Using Contracts
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...
Imene Ben Hafaiedh, Susanne Graf, Sophie Quinton
180
Voted
ICIP
2010
IEEE
15 years 5 months ago
Complexity-scalable H.264/AVC in an IPP-based video encoder
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...
IPPS
2010
IEEE
15 years 5 months ago
Performance improvements of real-time crowd simulations
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 ...
Guillermo Vigueras, Juan M. Orduña, Miguel ...