LSVF: a New Search Heuristic to Reduce the Backtracking Calls for Solving Constraint Satisfaction Problem

Abstract

Many researchers in Artificial Intelligence seek for new algorithms to reduce the amount of memory/ time consumed for general searches in Constraint Satisfaction Problems. These improvements are accomplished by the use of heuristics which either prune useless tree search branches or even indicate the path to reach the (optimal) solution faster than the blind version of the search. Many heuristics were proposed in the literature, like the Least Constraining Value (LCV). In this paper we propose a new pre-processing search heuristic to reduce the amount of backtracking calls, namely the Least Suggested Value First: a solution whenever the LCV solely cannot measure how much a value is constrained. In this paper, we present a pedagogical example, as well as the preliminary results.

Authors and Affiliations

Ryan Ribeiro de Azevedo , Cleyton Rodrigues , Fred Freitas , Eric Dantas

Keywords

Related Articles

 Method for Surface Reflectance Estimation with MODIS by Means of Bi-Section between MODIS and Estimated Radiance as well as Atmospheric Correction with Skyradiometer

 Method for surface reflectance estimation with MODIS by means of bi-section algorithm between MODIS and estimated radiance is proposed together with atmospheric correction with sky-radiometer data. Surface reflecta...

Color Radiomap Interpolation for Efficient Fingerprint WiFi-based Indoor Location Estimation

 Indoor location estimation system based on existing 802.11 signal strength is becoming increasingly prevalent in the area of mobility and ubiquity. The user-based location determination system utilizes the informat...

An improvement direction for filter selection techniques using information theory measures and quadratic optimization

Filter selection techniques are known for their simplicity and efficiency. However this kind of methods doesn’t take into consideration the features inter-redundancy. Consequently the un-removed redundant features remain...

 Multifidus Muscle Volume Estimation Based on Three Dimensional Wavelet Multi Resolution Analysis: MRA with Buttocks Computer-Tomography: CT Images

Multi-Resolution Analysis:. MRA based edge detection algorithm is proposed for estimation of volume of multifidus muscle in the Computer Tomography: CT scanned image The volume of multifidus muscle would be a good measur...

 Students’ Weakness Detective in Traditional Class

 In Artificial Intelligent in Education in learning contexts and domains, the traditional classroom is tough to find students’ weakness during lecture due to the student’s number and because the instruction is busy...

Download PDF file
  • EP ID EP103684
  • DOI -
  • Views 134
  • Downloads 0

How To Cite

Ryan Ribeiro de Azevedo, Cleyton Rodrigues, Fred Freitas, Eric Dantas (2012). LSVF: a New Search Heuristic to Reduce the Backtracking Calls for Solving Constraint Satisfaction Problem. International Journal of Advanced Research in Artificial Intelligence(IJARAI), 1(9), 20-25. https://europub.co.uk/articles/-A-103684