5668 search results - page 310 / 1134 » The case for software evolution |
176
click to vote
CC
2007
Springer
15 years 6 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
279
click to vote
GIS
2008
ACM
16 years 7 months ago
2008
ACM
Given a spatial crime data warehouse, that is updated infrequently and a set of operations O as well as constraints of storage and update overheads, the index type selection probl...
200
Voted
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
We discuss here a parallel implementation of the visualisation of data from a galaxy formation simulation within the Triana problem-solving environment. The visualisation is a tes...
113
Voted
ICSM
2006
IEEE
16 years 22 days ago
2006
IEEE
Software development, testing, and maintenance tools must yield assurance information in a standardized form. Developers can use this information to argue that the software is ade...
176
click to vote
SAC
2002
ACM
15 years 6 months ago
2002
ACM
This paper explores the limitations of one technique for modelling computer-based systems with evolving requirements. A case study is introduced which highlights the importance of...