590 search results - page 55 / 118 » Can We Learn to Beat the Best Stock |
PLDI
2003
ACM
15 years 3 months ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
IWANN
1999
Springer
15 years 2 months ago
1999
Springer
The performance characteristics of five variants of the Hopfield network are examined. Two performance metrics are used: memory capacity, and a measure of the size of basins of att...
AAAI
2008
15 years 4 days ago
2008
This paper examines, by argument, the dynamics of sequences of behavioural choices made, when non-cooperative restricted-memory agents learn in partially observable stochastic gam...
ATAL
2008
Springer
14 years 12 months ago
2008
Springer
We address the learning of trust based on past observations and context information. We argue that from the truster's point of view trust is best expressed as one of several ...