840 search results - page 51 / 168 » The Complexity of the Extended GCD Problem |
AAAI
1996
13 years 9 months ago
1996
In this paper we describe the design and implementation of the derivation replay framework, dersnlp+ebl (Derivational snlp+ebl), which is based within a partial order planner. der...
COCO
2010
Springer
13 years 11 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
GIS
2008
ACM
14 years 9 months ago
2008
ACM
In this paper we propose to apply hierarchical graphs to indoor navigation. The intended purpose is to guide humans in large public buildings and assist them in wayfinding. We sta...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— Use of a Gaussian Sum filter (GSF) to efficiently solve the initialisation problem in bearing-only simultaneous localisation and mapping (SLAM) is the main contribution of th...
EDBTW
2010
Springer
14 years 2 months ago
2010
Springer
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...