155 search results - page 24 / 31 » On learning linear ranking functions for beam search |
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Tetris is a falling block game where the player’s objective is to arrange a sequence of different shaped tetrominoes smoothly in order to survive. In the intelligence games, ag...
WEBDB
2010
Springer
14 years 18 days ago
2010
Springer
The transition of search engine users’ intents has been studied for a long time. The knowledge of intent transition, once discovered, can yield a better understanding of how diï...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
NIPS
2007
13 years 9 months ago
2007
We propose a method for reconstruction of human brain states directly from functional neuroimaging data. The method extends the traditional multivariate regression analysis of dis...
IJCAI
1993
13 years 8 months ago
1993
Heuristics used by search algorithms are usually composed of more primitive functions which we call "features". A method for combining features is presented which is bas...