1220 search results - page 103 / 244 » Restricting grammatical complexity |
EMISA
2007
Springer
14 years 2 months ago
2007
Springer
: Work systems are complex artifacts that address the concerns of a large and diverse group of stakeholders. These concerns must be reflected in the models which are created as use...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
VMCAI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
WG
2007
Springer
14 years 1 months ago
2007
Springer
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...