Sciweavers

402 search results - page 43 / 81
» Random Search for Hyper-Parameter Optimization
Sort
View
CIKM
2010
Springer
14 years 7 months ago
Improving verbose queries using subset distribution
Dealing with verbose (or long) queries poses a new challenge for information retrieval. Selecting a subset of the original query (a "sub-query") has been shown to be an ...
Xiaobing Xue, Samuel Huston, W. Bruce Croft
EVOW
2007
Springer
15 years 3 months ago
A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
Christian Blum, Carlos Cotta, Antonio J. Fern&aacu...
SLS
2007
Springer
111views Algorithms» more  SLS 2007»
15 years 3 months ago
Mixed Models for the Analysis of Local Search Components
We consider a possible scenario of experimental analysis on heuristics for optimization: identifying the contribution of local search components when algorithms are evaluated on th...
Jørgen Bang-Jensen, Marco Chiarandini, Yuri...
UC
2005
Springer
15 years 3 months ago
Quantum Searching Amidst Uncertainty
Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1 − , where ...
Lov K. Grover
GECCO
2004
Springer
15 years 3 months ago
Distributed Constraint Satisfaction, Restricted Recombination, and Hybrid Genetic Search
In this paper, we present simple and genetic forms of an evolutionary paradigm known as a society of hill-climbers (SoHC). We compare these simple and genetic SoHCs on a test suite...
Gerry V. Dozier, Hurley Cunningham, Winard Britt, ...