Sciweavers

997 search results - page 131 / 200
» Completely Lazy Learning
Sort
View
SIGCSE
2010
ACM
158views Education» more  SIGCSE 2010»
13 years 10 months ago
The benefits of pairing by ability
An analysis of data from 259 CS1 students is performed to compare the performance of students who were paired by demonstrated ability to that of students who were paired randomly ...
Grant Braught, John MacCormick, Tim Wahls
ANOR
2010
85views more  ANOR 2010»
13 years 10 months ago
Inventory management with partially observed nonstationary demand
Abstract. We consider a continuous-time model for inventory management with Markov modulated non-stationary demands. We introduce active learning by assuming that the state of the ...
Erhan Bayraktar, Michael Ludkovski
CONNECTION
2006
101views more  CONNECTION 2006»
13 years 10 months ago
High capacity, small world associative memory models
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
Neil Davey, Lee Calcraft, Rod Adams
ENTCS
2006
103views more  ENTCS 2006»
13 years 10 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
COGSCI
2004
97views more  COGSCI 2004»
13 years 9 months ago
A rhythm recognition computer program to advocate interactivist perception
This paper advocates the main ideas of the interactive model of representation of Mark Bickhard and the assimilation/accommodation framework of Jean Piaget, through a rhythm recog...
Jean-Christophe Buisson