Patrick Prosser Hybrid Algorithms for the Constraint Satisfaction Problem Technical Report AISL-46-91, Computer Science Dept, University of Strathclyde, Scotland, 1991  Home/Search   Document Not in Database   Summary   Related Articles

.... been developed including backtracking (BT) Golomb65] Bitner75] backmarking (BM) Gaschnig77] forward checking (FC) Haralick80] backjumping (BJ) Gaschnig78] graph based backjumping (GBJ) Dechter88] hybrid algorithms such as checking forwards while conflict directed backjumping (FC CBJ) [Prosser91] and extensions to these hybrid algorithms [Luo92b] However, in the real world, we may have to deal with distributed CSPs. There are two main reasons to address distributed CSPs: firstly, CSPs themselves are logically or geographically distributed in a number of cases. These problems may best be ....

....the imbalance caused by using the total order. To avoid unnecessary search paths and consistency checks [Luo92a] uses distributed extended forward checking which records nogood values (values which cause conflict) and uses them during search. It also employs a conflict directed backjump method [Prosser91] when resolving conflicts which attempts to find the root cause of any conflict. An important part of the algorithm of [Luo92a] is its ability to cope with dynamic changes within a DCSP. Many real world problems are dynamic and it is desirable not to lose valuable information or, even worse, to ....

[Article contains additional citation context not shown here]

Patrick Prosser Hybrid Algorithms for the Constraint Satisfaction Problem Technical Report AISL-46-91, Computer Science Dept, University of Strathclyde, Scotland, 1991

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC