New approaches to design and control of time limited search algorithms

Aine, Sandip ; Chakrabarti, P. P. (2009) New approaches to design and control of time limited search algorithms Lecture Notes in Computer Science, 5909 . pp. 1-6. ISSN 0302-9743

Full text not available from this repository.

Official URL: http://www.springerlink.com/content/94l263m2g84004...

Related URL: http://dx.doi.org/10.1007/978-3-642-11164-8_1

Abstract

We talk about two key aspects of the quality-time trade-offs in time limited search based reasoning namely, design of efficient anytime algorithms and formulations for meta-reasoning (or control) to optimize the computational trade-off under various constrained environments. We present the ideas behind novel anytime heuristic search algorithms, both contract and interruptible. We also describe new meta-control strategies that address parameter control along with time deliberation.

Item Type:Article
Source:Copyright of this article belongs to Springer-Verlag.
ID Code:5998
Deposited On:19 Oct 2010 09:54
Last Modified:16 Jul 2012 05:06

Repository Staff Only: item control page