Sciweavers

12659 search results - page 2388 / 2532
» The distributed breakout algorithms
Sort
View
SIGSOFT
2007
ACM
16 years 5 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
SIGSOFT
2005
ACM
16 years 5 months ago
Facilitating software evolution research with kenyon
Software evolution research inherently has several resourceintensive logistical constraints. Archived project artifacts, such as those found in source code repositories and bug tr...
Jennifer Bevan, E. James Whitehead Jr., Sunghun Ki...
SIGSOFT
2005
ACM
16 years 5 months ago
Automatic generation of suggestions for program investigation
Before performing a modification task, a developer usually has to investigate the source code of a system to understand how to carry out the task. Discovering the code relevant to...
Martin P. Robillard
SIGSOFT
2004
ACM
16 years 5 months ago
System architecture: the context for scenario-based model synthesis
Constructing rigorous models for analysing the behaviour of concurrent and distributed systems is a complex task. Our aim is to facilitate model construction. Scenarios provide si...
Jeff Kramer, Jeff Magee, Robert Chatley, Sebasti&a...
SIGSOFT
2003
ACM
16 years 5 months ago
Towards scalable compositional analysis by refactoring design models
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
Yung-Pin Cheng, Michal Young, Che-Ling Huang, Chia...
« Prev « First page 2388 / 2532 Last » Next »