{"repository":{"description":"Sequential and distributed AND/OR Branch and Bound for MPE (max-product) problems over graphical models like Bayes and Markov networks.","homepage":"","watchers":5,"stargazers":5,"forks":0,"fork":false,"size":348,"owner":"lotten","private":false,"open_issues":2,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C++","created_at":"2012-02-08T11:00:53-08:00","pushed_at":"2013-07-07T23:43:23-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Lars Otten","blog":"http://www.lotten.net/","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/lotten/daoopt/compare/2108c93c27...168345462b"}