A straight-forward way to solve a Constraint Satisfaction problem is via Depth-First Search:
This is how it looks like when you implement DFS in NetLogo:
Friday, January 25, 2013
Constraint Satisfaction: Centralized and Distributed
On Monday we will start the next chapter which covers Distributed Constraint Satisfaction and Optimization algorithms. The videos below cover some of this material:
A straight-forward way to solve a Constraint Satisfaction problem is via Depth-First Search:
This is how it looks like when you implement DFS in NetLogo:
A straight-forward way to solve a Constraint Satisfaction problem is via Depth-First Search:
This is how it looks like when you implement DFS in NetLogo:
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment