283 search results - page 7 / 57 » Local Search in Histogram Construction |
119
Voted
WWW
2011
ACM
14 years 6 months ago
2011
ACM
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
151
click to vote
TELSYS
2011
14 years 6 months ago
2011
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
83
Voted
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
Finding binary sequences with low autocorrelation is a very hard problem with many practical applications. In this paper we analyze several metaheuristic approaches to tackle the ...
204
Voted
ICDE
2002
IEEE
16 years 1 months ago
2002
IEEE
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
111
Voted
AIPS
2007
15 years 2 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...