13621 search results - page 144 / 2725 » Computability and Complexity in Self-assembly |
165
click to vote
DLOG
2003
15 years 7 months ago
2003
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
152
click to vote
CG
2004
Springer
15 years 6 months ago
2004
Springer
This work presents a stratification approach for modeling two-dimensional cell complexes. It introduces the concept of combinatorial stratification and uses the Handlebody theory ...
138
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— This paper addresses two key limitations of the unscented Kalman filter (UKF) when applied to the simultaneous localization and mapping (SLAM) problem: the cubic, in the numbe...
164
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
There is a recent trend of extending epistemic logic (EL) with dynamic operators that allow to express the evolution of knowledge and induced by knowledge-changing actions. The mo...
177
click to vote
MFCS
2009
Springer
16 years 29 days ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...