<--- Back to Details
First PageDocument Content
Constraint programming / Mathematics / Constraint satisfaction problem / Constraint satisfaction / Algorithm / Shortest path problem / Theoretical computer science / Min-conflicts algorithm / Distributed constraint optimization
Date: 2016-07-21 01:26:16
Constraint programming
Mathematics
Constraint satisfaction problem
Constraint satisfaction
Algorithm
Shortest path problem
Theoretical computer science
Min-conflicts algorithm
Distributed constraint optimization

Second International Conference on Multiagent SystemsDistributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems Makoto Yokoo

Add to Reading List

Source URL: agent.inf.kyushu-u.ac.jp

Download Document from Source Website

File Size: 152,63 KB

Share Document on Facebook

Similar Documents

Second International Conference on Multiagent SystemsDistributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems Makoto Yokoo

Second International Conference on Multiagent SystemsDistributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems Makoto Yokoo

DocID: 1rliX - View Document

Robust Solutions for Constraint Satisfaction and Optimization Emmanuel Hebrard and Brahim Hnich and Toby Walsh 12 Abstract. Super solutions are a mechanism to provide robustness to constraint programsThey are solu

Robust Solutions for Constraint Satisfaction and Optimization Emmanuel Hebrard and Brahim Hnich and Toby Walsh 12 Abstract. Super solutions are a mechanism to provide robustness to constraint programsThey are solu

DocID: 187b0 - View Document

IT[removed]Examensarbete 15 hp

IT[removed]Examensarbete 15 hp

DocID: 4NtY - View Document