Sciweavers

4432 search results - page 116 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
ISAAC
2003
Springer
104views Algorithms» more  ISAAC 2003»
15 years 8 months ago
Deterministic Algorithm for the t-Threshold Set Problem
Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We pr...
Jérémy Barbay, Claire Kenyon
APWEB
2010
Springer
15 years 6 months ago
An Incremental Prefix Filtering Approach for the All Pairs Similarity Search Problem
Given a set of records, a threshold value t and a similarity function, we investigate the problem of finding all pairs of records such that similarity between each pair is above t....
Hoang Thanh Lam, Dinh Viet Dung, Raffaele Perego, ...
MP
2006
101views more  MP 2006»
15 years 3 months ago
Computational complexity of stochastic programming problems
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...
Martin E. Dyer, Leen Stougie
GECCO
2004
Springer
106views Optimization» more  GECCO 2004»
15 years 8 months ago
Run Transferable Libraries - Learning Functional Bias in Problem Domains
Abstract. This paper introduces the notion of Run Transferable Libraries, a mechanism to pass knowledge acquired in one GP run to another. We demonstrate that a system using these ...
Maarten Keijzer, Conor Ryan, Mike Cattolico
EMO
2003
Springer
137views Optimization» more  EMO 2003»
15 years 8 months ago
A Two-Phase Local Search for the Biobjective Traveling Salesman Problem
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
Luis Paquete, Thomas Stützle