23590 search results - page 562 / 4718 » Algorithm Performance Contest |
128
Voted
AIIA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In a recent work we have carried out CarpeDiem, a novel algorithm for the fast evaluation of Supervised Sequential Learning (SSL) classifiers. In this paper we point out...
111
click to vote
GEM
2008
15 years 6 months ago
2008
Classifying the endgame positions in Chess can be challenging for humans and is known to be a difficult task in machine learning. An evolutionary algorithm would seem to be the ide...
131
click to vote
IPCO
2008
15 years 6 months ago
2008
We discuss an implementation of the lexicographic version of Gomory's fractional cutting plane method and of two heuristics mimicking the latter. In computational testing on a...
122
Voted
CSC
2006
15 years 6 months ago
2006
How to price options efficiently and accurately is an important research problem. Options can be priced by the lattice model. Although the pricing results converge to the theoreti...
127
click to vote
FIMI
2004
15 years 6 months ago
2004
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...