Trie
The Trie is an ordered tree data structure used usually to store strings, in which case each node defines an association with a letter of the alphabet. Unlike a binary search tree, no node in the tree stores the key associated with that node; instead, its position in the tree defines the key with which it is associated.
Building a Domain-Independent Architecture for Planning, Learning and Execution (PELEA)
César Guzmán2, Vidal Alcázar1, David Prior3, Eva Onaindía2, Daniel Borrajo1, Juan Fdez-Olivares3.
Universidad Carlos III de Madrid1, Universidad Politècnica de València2, Universidad de Granada3
This paper appears in: 21th International Conference on Automated Planning and Scheduling, ICAPS - Systems Demo. Freiburg, Germany.
Issue Date: Jun.11-16, 2011
PELEA: Planning, Learning and Execution Architecture
Vidal Alcázar1, César Guzmán2, David Prior3, Daniel Borrajo1, Luis Castillo3, Eva Onaindia2
Universidad Carlos III de Madrid1, Universidad Politécnica de Valéncia2, Universidad de Granada3
This paper appears in: 28th Workshop of the UK Planning and Scheduling Special Interest Group, PLANSIG. Brescia, Italy.
Issue Date: Dec. 1-3, 2010 ISSN: 1368-5708
Anytime Plan Adaptation for Continuous Planning
Antonio Garrido, César Guzmán, Eva Onaindia
Universidad Politècnica de València,
This paper appears in: 28th Workshop of the UK Planning and Scheduling Special Interest Group, PLANSIG. Brescia, Italy.
Issue Date: Dec. 1-3, 2010
e-Tourism: A Tourist Recommendation and Planning Application - Journal
Sebastia, L.; Garcia, I.; Onaindia, E.; Guzman, C.
Universidad Politècnica de València,
This paper appears in: Journal on Artificial Intelligent, IEEE. Ohio, USA.
Issue Date: Oct. 3-5, 2009
A Group Recommender System for Tourist Activities
This paper appears in: 10th International Conference, EC-Web. Linz, Austria.
Issue Date: Sep. 1-4, 2009. Proceedings ISBN: 978-3-642-03963-8 Core: B
Page 3 of 4