Extending GENET with lazy arc consistency


     Related Videos

     Related Hubpages

    •  Doc. Url:    Embed Code: 

    • IEEE  status
      (0) (0 Votes)
      Views: (2003)   Date: (Publication Date: Sep 1998)   Pages: ()
    • Author:  Stuckey  P.J. Tam  V. Dept. of Comput. Sci.  Melbourne Univ.  Parkville  Vic.;  

    • Abstract:  Abstract Many important applications, such as graph coloring, scheduling and production planning, can be solved by GENET, a local search method which is used to solve binary constraint satisfaction problems (CSPs). Where complete search methods are typically augmented with consistency methods to reduce the search, local search methods are not. We propose a consistency technique, lazy arc consistency, which is suitable for use within GENET. We show it can improve the efficiency of the GENET search on some instances of binary CSPs, and does not suffer the overhead of full arc consistency

         Related Documents

           Related Groups

             Related Science News

               More on Sciencestage

                 Answers

                 News

                 Related on Wikipedia




























               

              Powered free by PHPmotion