Shortest path discovery problems: a framework, algorithms and experimental results
Szepesvári, Csaba (2004) Shortest path discovery problems: a framework, algorithms and experimental results. In: Artificial Intelligence. Proceedings of the 19th National Conference AAAI-04, and Proceedings of the 16th Innovative Applications of AI (IAAI-04), San Jose. (AAAI-04/IAAI-04).
![[img]](https://eprints.sztaki.hu/style/images/fileicons/text.png) |
Text
szepesaaai2004.pdf - Published Version Restricted to Registered users only Download (153kB) |
Official URL: http://www.sztaki.hu/~szcsaba/papers/szepes-aaai20...
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Depositing User: | Eszter Nagy |
| Date Deposited: | 11 Dec 2012 15:16 |
| Last Modified: | 11 Dec 2012 15:16 |
| URI: | https://eprints.sztaki.hu/id/eprint/3456 |
 |
Update Item |
