Comparison of Different Approaches for Solving Distributed Constraint Satisfaction Problems

First Page		Document Content
Date: 2006-01-11 04:22:21 Artificial intelligence Constraint satisfaction Search algorithm Hybrid algorithm Algorithm Backjumping Parallel computing Backtracking Distributed algorithm Constraint programming Computer programming Software engineering		Comparison of Different Approaches for Solving Distributed Constraint Satisfaction Problems Add to Reading List Source URL: www.aaai.org Download Document from Source Website File Size: 835,80 KB Share Document on Facebook

	Estimating the Clustering Coefficient of a Social Network by a Non-Backtracking Random Walk Kenta Iwasaki, and Kazuyuki Shudo Tokyo Institute of Technology Abstract—The clustering coefficient of social networks can be DocID: 1uxoe - View Document
	Trying to understand PEG∗ Roman Redziejowski Abstract Parsing Expression Grammar (PEG) encodes a recursive-descent parser with limited backtracking. Its properties are useful in many applications, but it is not well un DocID: 1upp8 - View Document
	Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking∗ Roman R. Redziejowski Abstract Two recent developments in the field of formal languages are Parsing Expression Grammar (PEG) DocID: 1tWkC - View Document
	Reinventing Haskell Backtracking Sebastian Fischer Christian-Albrechts University of Kiel, Germany Abstract: Almost ten years ago, Ralf Hinze has written a functional pearl on how to derive ba DocID: 1sVGI - View Document
	Reinventing Haskell Backtracking Sebastian Fischer Christian-Albrechts University of Kiel, Germany Abstract: Almost ten years ago, Ralf Hinze has written a functional pearl on how to derive ba DocID: 1sTns - View Document