Sciweavers

Share
5 search results - page 1 / 1
» Learning the Piece Values for Three Chess Variants
Sort
View
ICGA
2008
100views Optimization» more  ICGA 2008»
11 years 10 months ago
Learning the Piece Values for Three Chess Variants
A set of experiments for learning the values of chess pieces is described for the popular chess variants Crazyhouse Chess, Suicide Chess, and Atomic Chess. We follow an establishe...
Sacha Droste, Johannes Fürnkranz
CG
2000
Springer
12 years 2 months ago
Chess Neighborhoods, Function Combination, and Reinforcement Learning
Abstract. Over the years, various research projects have attempted to develop a chess program that learns to play well given little prior knowledge beyond the rules of the game. Ea...
Robert Levinson, Ryan Weber
AIED
2009
Springer
12 years 4 months ago
Detecting the Learning Value of Items In a Randomized Problem Set
Researchers that make tutoring systems would like to know which pieces of educational content are most effective at promoting learning among their students. Randomized controlled e...
Zachary A. Pardos, Neil T. Heffernan
JMLR
2010
143views more  JMLR 2010»
11 years 8 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
EMNLP
2007
11 years 11 months ago
Structural Correspondence Learning for Dependency Parsing
Following (Blitzer et al., 2006), we present an application of structural correspondence learning to non-projective dependency parsing (McDonald et al., 2005). To induce the corre...
Nobuyuki Shimizu, Hiroshi Nakagawa
books