7106 search results - page 381 / 1422 » Restricted Complexity, General Complexity |
167
click to vote
VAMOS
2008
Springer
15 years 7 months ago
2008
Springer
This paper deals with managing variability on behavioral models. Such models are generally more complex, less tractable by hand than the static, structural parts of a system descr...
128
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
Multisource information theory in Shannon setting is well known. In this article we try to develop its algorithmic information theory counterpart and use it as the general framewo...
177
click to vote
DLOG
2003
15 years 7 months ago
2003
In this paper we introduce a decidable fixpoint extension of temporal Description Logics. We exploit the decidability results obtained for various monodic extensions of Descripti...
153
click to vote
ACTA
2007
15 years 6 months ago
2007
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the f...
162
click to vote
IPL
2008
15 years 6 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...