An Analysis of the Failure of Electronic Media and Discovery-based Learning: Evidence for the Performance Benefits of Guided Training Methods1. Richard Clark, Kenneth Yates, Sean Early and Kathrine Moulton Center for Cog

Source URL: www.cogtech.usc.edu

Enabling Real Time Data Analysis Divesh Srivastava, Lukasz Golab, Rick Greer, Theodore Johnson, Joseph Seidel, Vladislav Shkapenyuk, Oliver Spatscheck, Jennifer Yates AT&T Labs-Research {divesh,

Source URL: www.comp.nus.edu.sg

Using Cognitive Task Analysis to Capture Expert Knowledge and Skills for Research and Instructional Design Richard Clark, Ed.D.* David Feldon, Ph.D.** Kenneth Yates, Ed.D.*

Source URL: www.cogtech.usc.edu

Citation Clark, R. E., Feldon, D., vanMerrienboer, J., Yates, K, and Early, SCognitive Task Analysis. In Spector, J. M., Merrill, M. D., van Merriënboer, J. J. G., & Driscoll, M. P. (Eds.) Handbook of

Source URL: www.cogtech.usc.edu

Online and Offline Selling in Limit Order Markets Kevin L. Chang1? and Aaron Johnson2?? 1 Yahoo Inc.

Source URL: www.ohmygodel.com

• Theoretical computer science
• Online algorithms
• Financial markets
• Order
• Stock market
• Randomized algorithm
• Fisher–Yates shuffle
• Algorithm
• Competitive analysis
• Mathematics
• Analysis of algorithms
• Applied mathematics

IDT Site Experience - CQI Helen O’Shaughnessy Clinical Practice and Training Lead, LCW James Yates Implementation Manager, NHS Pathways

Source URL: systems.hscic.gov.uk

• Statistics
• Data analysis
• Outlier

PDF Document

Source URL: web.engr.illinois.edu

• Sorting algorithms
• Combinatorics
• Probabilistic complexity theory
• Permutations
• Quicksort
• Randomized algorithm
• Algorithm
• Fisher–Yates shuffle
• Merge sort
• Mathematics
• Theoretical computer science
• Analysis of algorithms

Permutation Tests (and Sampling Without Replacement) Orders of Magnitude Faster Using SAS® John Douglas (“J.D.”) Opdyke,* DataMineIt Abstract Six permutation test algorithms coded in SAS® are compared. The fastest

Source URL: www.datamineit.com

• Data analysis
• Statistical tests
• Non-parametric statistics
• Resampling
• SAS
• Permutation
• Bootstrapping
• Fisher–Yates shuffle
• Algorithm
• Statistics
• Statistical inference
• Monte Carlo methods

Permutation Tests (and Sampling Without Replacement) Orders of Magnitude Faster Using SAS® John Douglas (“J.D.”) Opdyke,* DataMineIt Abstract Six permutation test algorithms coded in SAS® are compared. The fastest

Source URL: interstat.statjournals.net

• Data analysis
• Statistical tests
• Non-parametric statistics
• Resampling
• SAS
• Permutation
• Bootstrapping
• Fisher–Yates shuffle
• Missing data
• Statistics
• Statistical inference
• Monte Carlo methods

CIS 194: Homework 7 Due Wednesday, 25 March Figure 1: The Haskell logo is modelled after the bind function (>>=) in the Monad type class

Source URL: www.seas.upenn.edu

• C++ Standard Library
• Sorting algorithms
• Analysis of algorithms
• Quicksort
• Science
• Monad
• Sequence container
• Fisher–Yates shuffle
• Randomized algorithm
• Mathematics
• Algebra
• Computing