5316 search results - page 29 / 1064 » Which Search Problems Are Random |
228
click to vote
JMLR
2012
13 years 10 months ago
2012
Grid search and manual search are the most widely used strategies for hyper-parameter optimization. This paper shows empirically and theoretically that randomly chosen trials are ...
208
click to vote
IJAMCIGI
2010
15 years 2 months ago
2010
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...
169
click to vote
GECCO
2004
Springer
16 years 25 days ago
2004
Springer
This study examines the utility of grammatical ephemeral random constants, and conducts an analysis of the preferences of evolutionary search when a number of different grammar ba...
214
Voted
EVOW
2004
Springer
16 years 26 days ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
223
click to vote
STACS
2005
Springer
16 years 28 days ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...