<--- Back to Details
First PageDocument Content
Computer programming / Local consistency / Constraint satisfaction problem / Constraint satisfaction / Backtracking / Constraint optimization / Eight queens puzzle / Branch and bound / Heuristic function / Constraint programming / Mathematics / Software engineering
Date: 2013-10-06 08:31:17
Computer programming
Local consistency
Constraint satisfaction problem
Constraint satisfaction
Backtracking
Constraint optimization
Eight queens puzzle
Branch and bound
Heuristic function
Constraint programming
Mathematics
Software engineering

C:/Documents and Settings/wkmak/Desktop/DropBox/Dropbox/Thesis/main.dvi

Add to Reading List

Source URL: www.tmak.info

Download Document from Source Website

File Size: 765,76 KB

Share Document on Facebook

Similar Documents

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