| Integrating OO road network database, cases and knowledge for route finding |
| Full text |
Pdf
(84 KB)
|
| Source
|
Symposium on Applied Computing
archive
Proceedings of the 2001 ACM symposium on Applied computing
table of contents
Las Vegas, Nevada, United States
Pages: 215 - 219
Year of Publication: 2001
ISBN:1-58113-287-5
|
|
Authors
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 7, Downloads (12 Months): 38, Citation Count: 0
|
|
|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
M.A. Anwar and T. Yoshida. Design and implementation of an object-oriented road network database. In International Conference on Enterprise Information Systems, volume I, pages 7 - 14, 1999.
|
 |
3
|
|
| |
4
|
|
| |
5
|
W. K. Chen. Theory of Nets: Flow in Networks. John Wiley & Sons, Inc., 1990.
|
| |
6
|
|
| |
7
|
B. Liu. Using knowledge to isolate search in route finding. In IJCAI-95, pages 119-125, 1995.
|
| |
8
|
B. Liu. Intelligent route finding: Combining knowledge, cases and an efficient search algorithm. In W. Wahlster, editor, Proceedings of ECAI96, 12th European Conference on Artificial Intelligence, pages 149-155. John Wiley & Sons, Ltd., 1996.
|
| |
9
|
B. Liu and J. Tay. Using knowledge about the road network for route finding. In IEEE Transactions on Systems, Man and Cybernetics, volume 27, July 1997.
|
| |
10
|
|
| |
11
|
J. Shapiro, J. Waxman, and D. Nir. Level graphs and approximate shortest path algorithm. In Networks, volume 22, pages 691-717, 1992.
|
| |
12
|
|
|