Cart (Loading....) | Create Account
Close category search window

Propagating updates in real-time search: FALCONS(k)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hernandez, C. ; Inst. d''Investigacio en Intelligencia Artificial, Consejo Superior de Investigaciones Cientificas, Bellaterra, Spain ; Meseguer, P.

We enhance real-time search algorithms with bounded propagation of heuristic changes. When the heuristic of the current state is updated, this change is propagated consistently up to k states not necessarily distinct. Applying this idea to FALCONS, we have develop the new FALCONS(k), an algorithm that keeps the good theoretical properties of FALCONS and improves its performance. We provide experimental results on benchmarks for real-time search, showing the benefits of our approach.

Published in:

Chilean Computer Science Society, 2005. SCCC 2005. 25th International Conference of the

Date of Conference:

7-11 Nov. 2005

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.