Sciweavers

598 search results - page 45 / 120
» A Deterministic Metaheuristic Approach Using
Sort
View
WSC
2007
15 years 4 months ago
Extension of the direct optimization algorithm for noisy functions
DIRECT (DIviding RECTangles) is a deterministic global optimization algorithm for bound-constrained problems. The algorithm, based on a space-partitioning scheme, performs both gl...
Geng Deng, Michael C. Ferris
CIKM
2011
Springer
14 years 2 months ago
Probabilistic near-duplicate detection using simhash
This paper offers a novel look at using a dimensionalityreduction technique called simhash [8] to detect similar document pairs in large-scale collections. We show that this algo...
Sadhan Sood, Dmitri Loguinov
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
15 years 9 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
SAGA
2007
Springer
15 years 8 months ago
A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis
Abstract. Motivated by an application in project portfolio analysis under uncertainty, we develop an algorithm S-VNS for solving stochastic combinatorial optimization (SCO) problem...
Walter J. Gutjahr, Stefan Katzensteiner, Peter Rei...
EOR
2008
75views more  EOR 2008»
15 years 2 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist