2657 search results - page 286 / 532 » On the complexity of hierarchical problem solving |
154
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have sho...
166
click to vote
ICWL
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The paper describes a complex e-learning experiment that has involved over 700 students that attended the Human-Computer Interaction course at the "Politehnica"...
130
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...
165
click to vote
HYBRID
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we present an automatable decompositional method for the computation of Lyapunov functions for hybrid systems with complex discrete state spaces. We use graph-based ...
178
click to vote
CPAIOR
2009
Springer
16 years 1 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...