19320 search results - page 299 / 3864 » On the complexity of computing determinants |
171
click to vote
DLOG
2003
15 years 8 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...
159
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 ...
141
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...
171
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...
198
click to vote
HPCC
2007
Springer
16 years 26 days ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...