Application of CSP in Optimizing the Path Loss of Wireless Indoor Propagation Model

Free registration required

Executive Summary

Constraint Satisfaction Programming (CSP) is an emergent software technology for declarative description and effective solving of large particularly combinational problem especially in term of planning and scheduling. Constraint programming is the study of computational system based on constraints. The idea of constraint programming is to solve problem by stating constraints about the problem and consequently finding the solution satisfying all the constraints. In this paper the application of constraint satisfaction programming is used in predicting the path loss of various empirical propagation models using chronological backtrack algorithm, which is basic algorithm of CSP.

  • Format: PDF
  • Size: 398 KB