The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
Many formal models of cognition implicitly use subjective probability distributions to capture the assumptions of human learners. Most applications of these models determine these...
—This paper presents a novel student model intended to automate word-list-based reading assessments in a classroom setting, specifically for a student population that includes b...
Joseph Tepperman, Sungbok Lee, Shrikanth Narayanan...
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...