5316 search results - page 102 / 1064 » Which Search Problems Are Random |
139
Voted
CLUSTER
2008
IEEE
15 years 9 months ago
2008
IEEE
—This paper describes the application of various search techniques to the problem of automatic empirical code optimization. The search process is a critical aspect of auto-tuning...
117
click to vote
CEC
2010
IEEE
15 years 23 days ago
2010
IEEE
Extremal optimisation (EO) is a relatively recent nature-inspired heuristic whose search method is especially suitable to solve combinatorial optimisation problems. To date, most o...
151
click to vote
SAGA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Motivated by an application in project portfolio analysis under uncertainty, we develop an algorithm S-VNS for solving stochastic combinatorial optimization (SCO) problem...
123
Voted
CEC
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— The DNA fragment assembly problem is to reconstruct a DNA chain from multiple fragments that have previously been sequenced in a laboratory. This is a critical step in ...
124
click to vote
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...