<--- Back to Details
First PageDocument Content
Applied mathematics / Educational psychology / Algorithm / Mathematical logic / Theoretical computer science / Backtracking / Euclidean algorithm / Instructional scaffolding / Heuristic / Mathematics / Operations research / Search algorithms
Date: 2015-01-18 12:04:10
Applied mathematics
Educational psychology
Algorithm
Mathematical logic
Theoretical computer science
Backtracking
Euclidean algorithm
Instructional scaffolding
Heuristic
Mathematics
Operations research
Search algorithms

Add to Reading List

Source URL: research.microsoft.com

Download Document from Source Website

File Size: 3,59 MB

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