Sciweavers

1646 search results - page 324 / 330
» To ask or not to ask, that is the question
Sort
View
IWPEC
2010
Springer
13 years 5 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
ICFEM
2009
Springer
13 years 5 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
ICSM
2009
IEEE
13 years 5 months ago
Decomposing object-oriented class modules using an agglomerative clustering technique
Software can be considered a live entity, as it undergoes many alterations throughout its lifecycle. Furthermore, developers do not usually retain a good design in favor of adding...
Marios Fokaefs, Nikolaos Tsantalis, Alexander Chat...
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 4 months ago
Cause Clue Clauses: Error Localization using Maximum Satisfiability
Much effort is spent everyday by programmers in trying to reduce long, failing execution traces to the cause of the error. We present a new algorithm for error cause localization ...
Manu Jose, Rupak Majumdar
IEPOL
2010
198views more  IEPOL 2010»
13 years 4 months ago
Music file sharing and sales displacement in the iTunes era
A growing empirical literature examines the relationship between music file sharing and legal purchases of music, but existing studies examine the period before consumers had attr...
Joel Waldfogel