Sciweavers

3897 search results - page 575 / 780
» complexity 2010
Sort
View
SOSYM
2010
124views more  SOSYM 2010»
15 years 4 months ago
Lifting transformational models of product lines: a case study
Model driven development (MDD) of software product lines (SPLs) merges two increasing important paradigms that synthesize programs by transformation. MDD creates programs by transf...
Greg Freeman, Don S. Batory, R. Greg Lavender, Jac...
SPIRE
2010
Springer
15 years 4 months ago
String Matching with Variable Length Gaps
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
Philip Bille, Inge Li Gørtz, Hjalte Wedel V...
SPIRE
2010
Springer
15 years 4 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
SSIRI
2010
15 years 4 months ago
A Formal Framework for Mutation Testing
— Model-based approaches, especially based on directed graphs (DG), are becoming popular for mutation testing as they enable definition of simple, nevertheless powerful, mutation...
Fevzi Belli, Mutlu Beyazit
SSS
2010
Springer
158views Control Systems» more  SSS 2010»
15 years 4 months ago
Low Memory Distributed Protocols for 2-Coloring
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
Amos Israeli, Mathew D. McCubbins, Ramamohan Patur...