Sciweavers

1635 search results - page 144 / 327
» Reasoning from Data Rather than Theory
Sort
View
ML
2000
ACM
126views Machine Learning» more  ML 2000»
13 years 9 months ago
Learning to Play Chess Using Temporal Differences
In this paper we present TDLEAF( ), a variation on the TD( ) algorithm that enables it to be used in conjunction with game-tree search. We present some experiments in which our che...
Jonathan Baxter, Andrew Tridgell, Lex Weaver
POPL
2012
ACM
12 years 4 months ago
The ins and outs of gradual type inference
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
Aseem Rastogi, Avik Chaudhuri, Basil Hosmer
CHI
2008
ACM
14 years 9 months ago
Usability evaluation considered harmful (some of the time)
Current practice in Human Computer Interaction as encouraged by educational institutes, academic review processes, and institutions with usability groups advocate usability evalua...
Saul Greenberg, William Buxton
ML
2006
ACM
110views Machine Learning» more  ML 2006»
13 years 9 months ago
Classification-based objective functions
Backpropagation, similar to most learning algorithms that can form complex decision surfaces, is prone to overfitting. This work presents classification-based objective functions, ...
Michael Rimer, Tony Martinez
ISCA
1998
IEEE
123views Hardware» more  ISCA 1998»
14 years 1 months ago
Weak Ordering - A New Definition
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory ac...
Sarita V. Adve, Mark D. Hill