BibTex

Frontier Search for Bicriterion Shortest Path Problems

Lawrence Mandow and J. L. Pérez de la Cruz.
Frontier search for bicriterion shortest path problems.
In Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence, pages 480-484, Amsterdam, The Netherlands, The Netherlands, 2008. IOS Press.

Abstract

Frontier search is a new search technique that achieves important memory savings over previous best-first search algorithms. This paper describes an extension of frontier search to bicriterion graph search problems that achieves also important memory savings. The new algorithm is evaluated using a set of random problems.

BibTex

@inproceedings{Mandow:2008:C,
  acmid={1567387},
  numpages={5},
  url={http: //dl.acm.org/citation.cfm?id = 1567281.1567387},
  author={Mandow, Lawrence and P{\'e}rez de la Cruz, J. L.},
  title={Frontier Search for Bicriterion Shortest Path Problems},
  booktitle={Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence},
  publisher={IOS Press},
  address={Amsterdam, The Netherlands, The Netherlands},
  year={2008},
  pages={480--484},
}
Redmine Appliance - Powered by TurnKey Linux