Using Sampling to Dynamically Reconfigure Problem-Solvers

Santiago Franco, Mike Barley

The time it takes a program to solve a particular problem depends heavily upon the choice of problem solving method, the data representation, heuristics etc. The specific choices can have a dramatic impact on performance. This research aims to produce a formula based on these design decisions and problem characteristics which predicts how long the problem will run until a solution is found. As means to this end we are working on a prototype problem solving method which dynamically adapts its search configuration in order to speed up finding a solution.

Subjects: 1.11 Planning; 15.7 Search

Submitted: May 4, 2008

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.