880 search results - page 81 / 176 » The SLAM problem: a survey |
140
click to vote
IBERAMIA
1998
Springer
15 years 10 months ago
1998
Springer
In this article we analyze the problem of searching the WWW, giving some insight and models to understand its complexity. Then we survey the two main current techniques used to se...
206
click to vote
DFG
1992
Springer
15 years 10 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
169
click to vote
FMCO
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we give an overview on some algorithms for learning automata. Starting with Biermann's and Angluin's algorithms, we describe some of the extensions caterin...
177
click to vote
FOSAD
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. There is great interest in applying nominal calculi--computational formalisms that include dynamic name generation--to the problems of programming, specifying, and verify...
147
click to vote
BIRTHDAY
2008
Springer
15 years 8 months ago
2008
Springer
We survey some of the problems associated with checking whether a given behavior (a sequence, a Boolean signal or a continuous signal) satisfies a property specified in an appropri...