1 / 5

Main Idea

Main Idea. V. X. Y. Y =y. Tree variables. Cycle cutset variables. X =x. Tree algorithm. GSAT. Local search. Dynamic programming. Flow Chat. Initialize. Y =y. Tree algorithm. 1. Problem is solved. Exit. 2. Specified condition is reached. X =x. GSAT.

vivien
Download Presentation

Main Idea

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Main Idea V X Y Y=y Tree variables Cycle cutset variables X=x Tree algorithm GSAT Local search Dynamic programming

  2. Flow Chat Initialize Y=y Tree algorithm 1. Problem is solved. Exit 2. Specified condition is reached. X=x GSAT

  3. Inside view – calculate cost xi xj min min min SUM

  4. Inside view – calculate value Non-consistent values

  5. Summary 1. The problem must be solvable. 2. The problem must have tree-structure. 3. cycle-cutset size is bounded by 30% of the nodes. 4. All assigned value of X are consistent. So, too many restrictions…….

More Related