590 search results - page 79 / 118 » Can We Learn to Beat the Best Stock |
ACRI
2004
Springer
15 years 3 months ago
2004
Springer
We have investigated a problem where the goal is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type OBSTACLE, EMPTY or CRE...
ADAEUROPE
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Ada has proved to be one of the best languages to learn computer programming. Nevertheless, learning to program is difficult and when it is combined with lack of motivati...
AISADM
2007
Springer
15 years 4 months ago
2007
Springer
We believe that intelligent information agents will represent their users interest in electronic marketplaces and other forums to trade, exchange, share, identify, and locate goods...
AAAI
2004
14 years 11 months ago
2004
This paper presents a new boosting (arcing) algorithm called POCA, Parallel Online Continuous Arcing. Unlike traditional boosting algorithms (such as Arc-x4 and Adaboost), that co...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
Variable selection for cluster analysis is a difficult problem. The difficulty originates not only from the lack of class information but also the fact that high-dimensional data ...