15421 search results - page 99 / 3085 » Dependability |
FSTTCS
2008
Springer
13 years 10 months ago
2008
Springer
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
CSL
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
INFSOF
2008
13 years 8 months ago
2008
When software development teams modify their requirements engineering process as an independent variable, they often examine the implications of these process changes by assessing...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...
JUCS
2008
13 years 8 months ago
2008
: We address the problems of structuring and annotation of layout-oriented documents. We model the annotation problems as the collective classification on graph-like structures wit...