675 search results - page 11 / 135 » A parallel search algorithm for CLNS addition optimization |
108
click to vote
IJAIT
2007
15 years 18 days ago
2007
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
118
Voted
IPPS
2010
IEEE
14 years 10 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
114
Voted
SC
2005
ACM
15 years 6 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadth...
122
click to vote
SIGMOD
2012
ACM
13 years 3 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
132
click to vote
WWW
2011
ACM
14 years 7 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. ...