Sciweavers

4940 search results - page 683 / 988
» On the Complexity of Universal Programs
Sort
View
ITP
2010
178views Mathematics» more  ITP 2010»
15 years 8 months ago
Interactive Termination Proofs Using Termination Cores
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
Panagiotis Manolios, Daron Vroon
ICALP
2010
Springer
15 years 8 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
ERLANG
2008
ACM
15 years 8 months ago
Early fault detection with model-based testing
Current and future trends for software include increasingly complex requirements on interaction between systems. As a result, the difficulty of system testing increases. Model-bas...
Jonas Boberg
AAAI
2010
15 years 8 months ago
Evolving Compiler Heuristics to Manage Communication and Contention
As computer architectures become increasingly complex, hand-tuning compiler heuristics becomes increasingly tedious and time consuming for compiler developers. This paper presents...
Matthew E. Taylor, Katherine E. Coons, Behnam Roba...
CDES
2008
123views Hardware» more  CDES 2008»
15 years 8 months ago
R-tree: A Hardware Implementation
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
Xiang Xiao, Tuo Shi, Pranav Vaidya, Jaehwan John L...