Sciweavers

608 search results - page 90 / 122
» Tests, Proofs and Refinements
Sort
View
RE
2006
Springer
13 years 7 months ago
On Goal-based Variability Acquisition and Analysis
We introduce a variability-intensive approach to goal decomposition that is tailored to support requirements identification for highly customizable software. The approach is based...
Sotirios Liaskos, Alexei Lapouchnian, Yijun Yu, Er...
MTA
2007
86views more  MTA 2007»
13 years 7 months ago
Toolkits and interface creativity
Interface toolkits in ordinary application areas let average programmers rapidly develop software resembling other standard applications. In contrast, toolkits for novel and perhap...
Saul Greenberg
PR
2008
170views more  PR 2008»
13 years 7 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
LICS
2010
IEEE
13 years 5 months ago
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
Martin Grohe
MODELS
2010
Springer
13 years 5 months ago
transML: A Family of Languages to Model Model Transformations
Model transformation is one of the pillars of Model-Driven Engineering (MDE). The increasing complexity of systems and modelling languages has dramatically raised the complexity an...
Esther Guerra, Juan de Lara, Dimitrios S. Kolovos,...