TY  - JOUR
T1  - Improving Dlmi Algorithm by Incorporating New Features
AU - , Abdullah Mohdzin AU - , Yousef Kilani 
JO  - Asian Journal of Information Technology
VL  - 4
IS  - 12
SP  - 1120
EP  - 1126
PY  - 2005
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2005.1120.1126
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2005.1120.1126
KW  - DLM algorithm
KW  -DLMI algorithm
KW  -local search
KW  -SAT problems
AB  - The DLMI Algorithm is a local search algorithm for solving constraint satisfaction problems that incorporates the use of Island confinement method. Local search starts the search for a solution from a random assignment. It then examines the neighbours of this assignment, using the penalty function to determine a better neighbour valuations to move to. It repeats this process until it finds a solution that satisfies all constraints. The island confinement method considers some of the constraints as hard constraints that are always satisfied. In this way, the constraints reduce the possible neighbours in each move and hence the overall search space. We choose the hard constraints C in such away that the space of valuations that satisfies these constraints is connected in order to guarantee that a local search can reach a solution from any valuation in this space without violating C. A previous study has shown that the DLMI algorithm performs better than the original DLM algorithm. In this paper, we describe how incorporating learning in the island traps and restart improves the DLMI algorithm.
ER  -