9209 search results - page 136 / 1842 » Data Space Randomization |
158
click to vote
COR
2010
15 years 5 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
170
click to vote
ICALP
2003
Springer
15 years 10 months ago
2003
Springer
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
159
click to vote
SMC
2010
IEEE
15 years 3 months ago
2010
IEEE
—This study examines the ability of nonnegative matrix factorization (NMF) as a method for constructing semantic spaces, in which the meaning of each word is represented by a hig...
113
click to vote
CCGRID
2005
IEEE
15 years 10 months ago
2005
IEEE
Efficient memory allocation and data transfer for cluster-based data-intensive applications is a difficult task. Both changes in cluster interconnects and application workloads ...
166
click to vote
ICDM
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...