Sciweavers

928 search results - page 46 / 186
» Using fMRI to Test Models of Complex Cognition
Sort
View
SIGSOFT
2007
ACM
15 years 10 months ago
Measuring empirical computational complexity
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...
63
Voted
NIPS
2007
14 years 11 months ago
Markov Chain Monte Carlo with People
Many formal models of cognition implicitly use subjective probability distributions to capture the assumptions of human learners. Most applications of these models determine these...
Adam Sanborn, Thomas L. Griffiths
91
Voted
TASLP
2011
14 years 4 months ago
A Generative Student Model for Scoring Word Reading Skills
—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...
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
15 years 3 months ago
More on Noncommutative Polynomial Identity Testing
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...
Andrej Bogdanov, Hoeteck Wee
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 3 months ago
An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem
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...
Abdellah Salhi, José Antonio Vázquez...