5316 search results - page 29 / 1064 » Which Search Problems Are Random |
121
click to vote
JMLR
2012
13 years 3 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 ...
112
click to vote
IJAMCIGI
2010
14 years 7 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 ...
92
Voted
GECCO
2004
Springer
15 years 6 months 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...
109
click to vote
EVOW
2004
Springer
15 years 6 months 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 ...
123
Voted
STACS
2005
Springer
15 years 6 months 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 ...