Sciweavers

402 search results - page 4 / 81
» Random Search for Hyper-Parameter Optimization
Sort
View
VLDB
1991
ACM
134views Database» more  VLDB 1991»
15 years 1 months ago
Extending the Search Strategy in a Query Optimizer
In order to cope efficiently with simple or complex queries as well as different application requirements (e.g., ad-hoc versus repetitive queries), a query optimizer ought to supp...
Rosana S. G. Lanzelotte, Patrick Valduriez
96
Voted
SAT
2010
Springer
165views Hardware» more  SAT 2010»
14 years 8 months ago
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
Lukas Kroc, Ashish Sabharwal, Bart Selman
EOR
2002
125views more  EOR 2002»
14 years 9 months ago
Genetic local search for multi-objective combinatorial optimization
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
Andrzej Jaszkiewicz
86
Voted
IDA
1999
Springer
15 years 1 months ago
Nonparametric Linear Discriminant Analysis by Recursive Optimization with Random Initialization
A method for the linear discrimination of two classes has been proposed by us in 3 . It searches for the discriminant direction which maximizes the distance between the projected c...
Mayer Aladjem
EC
2007
167views ECommerce» more  EC 2007»
14 years 9 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud