94 search results - page 13 / 19 » Computability and Complexity Results for a Spatial Assertion... |
EUROPAR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. To resolve difficulties in parallel programming, a large number of studies are conducted on parallel skeletons and optimization theorems over skeleton programs. However, ...
KI
2010
Springer
13 years 2 months ago
2010
Springer
In this paper, we address the problem of lifelong map learning in static environments with mobile robots using the graph-based formulation of the simultaneous localization and mapp...
CG
2008
Springer
13 years 7 months ago
2008
Springer
Particle-based simulation methods are used to model a wide range of complex phenomena and to solve time-dependent problems of various scales. Effective visualizations of the resul...
POS
1998
Springer
13 years 11 months ago
1998
Springer
Persistent programming languages are targetted primarily at application systems involving complex data structures and relationships, as typi ed by Geographical Information Systems...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...