Sciweavers

1859 search results - page 231 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
ICASSP
2011
IEEE
14 years 8 months ago
Factor graph switching portfolios under transaction costs
We consider the sequential portfolio investment problem. Building on results in signal processing, machine learning, and other areas, we use factor graphs to develop new universal...
Andrew J. Bean, Andrew C. Singer
UAI
2008
15 years 6 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
JMLR
2008
230views more  JMLR 2008»
15 years 5 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...
VLC
2010
156views more  VLC 2010»
14 years 11 months ago
Visual instructional design languages
Submission Deadline: December 14, 2009 The Journal of Visual Languages and Computing (http://www.elsevier.com/locate/jvlc, impact factor: 0.863) invites authors to submit papers fo...
Manuel Caeiro Rodríguez, Michael Derntl, Lu...
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
15 years 11 months ago
Bayesian estimation of rule accuracy in UCS
Learning Classifier Systems differ from many other classification techniques, in that new rules are constantly discovered and evaluated. This feature of LCS gives rise to an im...
James A. R. Marshall, Gavin Brown, Tim Kovacs