3396 search results - page 569 / 680 » Tree representations of graphs |
144
click to vote
RE
2005
Springer
15 years 10 months ago
2005
Springer
A reverse engineering process aims at reconstructing el abstractions from source code. This paper presents a novel reverse engineering methodology for recovering stakeholder goal ...
164
click to vote
AMAI
2004
Springer
15 years 10 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
161
click to vote
CSCLP
2004
Springer
15 years 10 months ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
137
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
The doubling constant of a metric space (X, d) is the smallest value λ such that every ball in X can be covered by λ balls of half the radius. The doubling dimension of X is the...
175
click to vote
FSTTCS
2003
Springer
15 years 9 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...