3055 search results - page 197 / 611 » Randomized Search Trees |
108
Voted
SIGIR
2009
ACM
15 years 7 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...
95
Voted
EVOW
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
123
click to vote
FLAIRS
2007
15 years 3 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
113
click to vote
EMO
2001
Springer
15 years 5 months ago
2001
Springer
When we try to implement a multi-objective genetic algorithm (MOGA) with variable weights for finding a set of Pareto optimal solutions, one difficulty lies in determining appropri...
114
Voted
COMPGEOM
2008
ACM
15 years 2 months ago
2008
ACM
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...