152 search results - page 14 / 31 » An Experimental Study of Random Knapsack Problems |
SIGIR
2009
ACM
14 years 1 months ago
2009
ACM
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
ICML
2004
IEEE
14 years 7 months ago
2004
IEEE
Classifier learning methods commonly assume that the training data consist of randomly drawn examples from the same distribution as the test examples about which the learned model...
SLS
2007
Springer
14 years 25 days ago
2007
Springer
We consider a possible scenario of experimental analysis on heuristics for optimization: identifying the contribution of local search components when algorithms are evaluated on th...
TSP
2008
13 years 6 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
TEC
2008
13 years 6 months ago
2008
In recent years, interest in studying evolutionary algorithms (EAs) for dynamic optimization problems (DOPs) has grown due to its importance in real-world applications. Several app...