Adjuncts
Unobtrusive javascript
Hearn E.J - Mechanics of Materials Vol 1 Karan Gupta
Embarrassingly Parallel Computation for Occlusion Culling
Bookpad - SaaS Launchpad
Cubing thinkdotpp
Lss pharma presentation2-2006
When Qubits Go Analog A Relatively Easy Problem in Quantum Information Theory Scott Aaronson (MIT)
20 April 2010 /JME & CJI BMAF Annual Conference 2010 Accounting for learner differences in the classroom means some students have to plagiarise John English.
Complexity. P=NP? Who knows? Who cares? Lets revisit some questions from last time – How many pairwise comparisons do I need to do to check if a sequence.
Reinforcement Learning: A Tutorial Rich Sutton AT&T Labs -- Research sutton.
Efficiently Solving Computer Programming Problems Svetlin Nakov Telerik Corporation .
