-
1
-
-
84923103437
-
Piecemeal graph learning by a mobile robot
-
Academic Press, New York, San Diego, CA
-
B. AWERBUCH, M. BETKE, R. RIVEST, AND M. SINGH, Piecemeal graph learning by a mobile robot, in Proceedings of the 8th Conference on Comput. Learning Theory, Academic Press, New York, San Diego, CA, 1995, pp. 321-328.
-
(1995)
Proceedings of the 8th Conference on Comput. Learning Theory
, pp. 321-328
-
-
Awerbuch, B.1
Betke, M.2
Rivest, R.3
Singh, M.4
-
2
-
-
0000577784
-
On-line navigation in a room
-
E. BAR-ELI, P. BERMAN, A. FIAT, AND R. YAN, On-line navigation in a room, J. Algorithms, 17 (1994), pp. 319-341.
-
(1994)
J. Algorithms
, vol.17
, pp. 319-341
-
-
Bar-Eli, E.1
Berman, P.2
Fiat, A.3
Yan, R.4
-
3
-
-
0027038959
-
A sublinear space, polynomial time algorithm for directed s-1 connectivity
-
IEEE Computer Society, Los Alamitos, CA
-
G. BARNES, J. F. Buss, W. L. Ruzzo, AND B. SCHIEBER, A sublinear space, polynomial time algorithm for directed s-1 connectivity, in Proceedings of the 7th Annual Conference on Structure in Complexity Theory, IEEE Computer Society, Los Alamitos, CA, 1992, pp. 27-33.
-
(1992)
Proceedings of the 7th Annual Conference on Structure in Complexity Theory
, pp. 27-33
-
-
Barnes, G.1
Buss, J.F.2
Ruzzo, W.L.3
Schieber, B.4
-
4
-
-
0342545781
-
Time-space lower bounds for directed s-t connectivity on graph automata models
-
G. BARNES AND J. EDMONDS, Time-space lower bounds for directed s-t connectivity on graph automata models, SIAM J. Comput., 27 (1998). pp. 1190-1202.
-
(1998)
SIAM J. Comput.
, vol.27
, pp. 1190-1202
-
-
Barnes, G.1
Edmonds, J.2
-
5
-
-
84966888626
-
Randomized robot navigation algorithms
-
ACM, New York, SIAM, Philadelphia, PA
-
P. BERMAN, A. BLUM, A. FIAT, H. KARLOFF, A. ROSÉN, AND M. SAKS, Randomized robot navigation algorithms, in Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, PA, 1996, pp. 74-84.
-
(1996)
Proceedings of the 7th ACM-sIAM Symposium on Discrete Algorithms
, pp. 74-84
-
-
Berman, P.1
Blum, A.2
Fiat, A.3
Karloff, H.4
Rosén, A.5
Saks, M.6
-
6
-
-
0027837675
-
An on-line algorithm for improving performance in navigation
-
IEEE Computer Society, Los Alamitos, CA
-
A. BLUM AND P. CHALASANI, An on-line algorithm for improving performance in navigation, in Proceedings of the 34th Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1993, pp. 2-11.
-
(1993)
Proceedings of the 34th Symposium on Foundations of Computer Science
, pp. 2-11
-
-
Blum, A.1
Chalasani, P.2
-
7
-
-
0003187777
-
Navigating in unfamiliar geometric terrain
-
A. BLUM, P. RAGHAVAN, AND B. SCHIEBER, Navigating in unfamiliar geometric terrain, SIAM J. Comput., 26 (1997), pp. 110-137.
-
(1997)
SIAM J. Comput.
, vol.26
, pp. 110-137
-
-
Blum, A.1
Raghavan, P.2
Schieber, B.3
-
8
-
-
0029256026
-
Piecemeal learning of an unknown environment
-
M. BETKE, R. RIVEST, AND M. SINGH, Piecemeal learning of an unknown environment, Machine Learning, 18 (1995), pp. 231-254.
-
(1995)
Machine Learning
, vol.18
, pp. 231-254
-
-
Betke, M.1
Rivest, R.2
Singh, M.3
-
9
-
-
84936752559
-
The power of team exploration: Two robots can learn unlabeled directed graphs
-
IEEE Computer Society, Los Alanmitos, CA
-
M. BENDER AND D. SLONIM, The power of team exploration: two robots can learn unlabeled directed graphs, in Proceedings of the 35th Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alanmitos, CA, 1994, pp. 75-85.
-
(1994)
Proceedings of the 35th Symposium on Foundations of Computer Science
, pp. 75-85
-
-
Bender, M.1
Slonim, D.2
-
10
-
-
0000434997
-
Space lower bounds for maze threadability on restricted machines
-
S. A. COOK AND C. W. RACKOFF, Space lower bounds for maze threadability on restricted machines, SIAM J. Comput., 9 (1980), pp. 636-652.
-
(1980)
SIAM J. Comput.
, vol.9
, pp. 636-652
-
-
Cook, S.A.1
Rackoff, C.W.2
-
11
-
-
0032026129
-
How to learn an unknown environment
-
X. DENG, T. KAMEDA, AND C. H. PAPADIMITRIOU, How to learn an unknown environment, J. ACM, 45 (1998), pp. 215-245.
-
(1998)
J. ACM
, vol.45
, pp. 215-245
-
-
Deng, X.1
Kameda, T.2
Papadimitriou, C.H.3
-
12
-
-
0002523385
-
Exploring an unknown graph
-
IEEE Computer Society, Los Alamitos, CA
-
X. DENG AND C. H. PAPADIMITRIOU, Exploring an unknown graph, in Proceedings of the 31st Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1990, pp. 356-361.
-
(1990)
Proceedings of the 31st Symposium on Foundations of Computer Science
, pp. 356-361
-
-
Deng, X.1
Papadimitriou, C.H.2
-
14
-
-
0004290830
-
A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model
-
ACM, New York
-
J. EDMONDS AND C. K. POON, A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model, in Proceedings of the 27th Symposium on the Theory of Computing, ACM, New York, 1995, pp. 147-156.
-
(1995)
Proceedings of the 27th Symposium on the Theory of Computing
, pp. 147-156
-
-
Edmonds, J.1
Poon, C.K.2
-
15
-
-
0030782578
-
A competitive strategy for learning a polygon
-
ACM, New York, SIAM, Philadelphia, PA
-
F. HOFFMANN, C. ICKING, R. KLEIN, AND K. KRIEGEL, A competitive strategy for learning a polygon, in Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, PA, 1997, pp. 166-174.
-
(1997)
Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms
, pp. 166-174
-
-
Hoffmann, F.1
Icking, C.2
Klein, R.3
Kriegel, K.4
-
16
-
-
85037787361
-
-
result reported in [13]
-
E. KOUTSOUPIAS, result reported in [13].
-
-
-
Koutsoupias, E.1
-
17
-
-
84947940108
-
On a simple depth-first search strategy for exploring unknown graphs
-
Proceedings of the 5th Workshop on Algorithms and Data Structures, Springer-Verlag, New York
-
S. KWEK, On a simple depth-first search strategy for exploring unknown graphs, in Proceedings of the 5th Workshop on Algorithms and Data Structures, Lecture Notes in Comput. Sci. 1272, Springer-Verlag, New York, 1997, pp. 345-353.
-
(1997)
Lecture Notes in Comput. Sci.
, vol.1272
, pp. 345-353
-
-
Kwek, S.1
-
19
-
-
85037796439
-
-
problem formulation cited in [12]
-
R. RIVEST, problem formulation cited in [12].
-
-
-
Rivest, R.1
|