Sciweavers

115 search results - page 11 / 23
» Versioning Tree Structures by Path-Merging
Sort
View
MSR
2006
ACM
14 years 3 months ago
Detecting similar Java classes using tree algorithms
Similarity analysis of source code is helpful during development to provide, for instance, better support for code reuse. Consider a development environment that analyzes code whi...
Tobias Sager, Abraham Bernstein, Martin Pinzger, C...
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 10 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
COLING
1996
13 years 11 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
SPLC
2000
13 years 11 months ago
Development/maintenance/reuse: software evolution in product lines
The evolution tree model is a two-dimensional model that describes how the versions of the artifacts of a software product evolve. The propagation graph is a data structure that c...
Stephen R. Schach, Amir Tomer
CP
2004
Springer
14 years 1 months ago
Unary Resource Constraint with Optional Activities
Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among thes...
Petr Vilím, Roman Barták, Ondrej Cep...