2393 search results - page 98 / 479 » Bounds-Consistent Local Search |
93
Voted
DAM
2008
15 years 23 days ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
143
Voted
LION
2009
Springer
15 years 7 months ago
2009
Springer
The fitness landscape of the resource constrained project scheduling problem is investigated by examining the search space position type distribution and the correlation between t...
104
Voted
IAJIT
2010
14 years 11 months ago
2010
: The coding gain of the H.264/AVC video encoder mainly comes from the new incorporated prediction tools. However, their enormous computation and ultrahigh memory bandwidth are the...
96
Voted
IEEEHPCS
2010
14 years 11 months ago
2010
Abstract. In this paper, we explore the two well-known principles of diversification and intensification in portfolio-based parallel SAT solving. These dual concepts play an impo...
139
click to vote
MMM
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...