554 search results - page 31 / 111 » Principles of scatter search |
IJCAI
2007
13 years 9 months ago
2007
Occam’s razor is the principle that, given two hypotheses consistent with the observed data, the simpler one should be preferred. Many machine learning algorithms follow this pr...
ICTIR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract Even the best information retrieval model cannot always identify the most useful answers to a user query. This is in particular the case with web search systems, where it ...
COR
2006
13 years 7 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
CHI
1994
ACM
13 years 11 months ago
1994
ACM
This paper offers new principles for visual information seeking (VIS). A key concept is to support browsing, which is distinguished from familiar query composition and information...
AAAI
2012
11 years 10 months ago
2012
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...