Sciweavers

1615 search results - page 237 / 323
» Pathology in heuristic search
Sort
View
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
14 years 1 months ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom
GECCO
2009
Springer
125views Optimization» more  GECCO 2009»
14 years 1 months ago
Preserving population diversity for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem’s main objective is to find the lowest-cost set of routes to deliver goods to customers, which have a service time window, using a fleet of identic...
Abel Garcia-Najera
GECCO
2009
Springer
126views Optimization» more  GECCO 2009»
14 years 1 months ago
Improving NSGA-II with an adaptive mutation operator
The performance of a Multiobjective Evolutionary Algorithm (MOEA) is crucially dependent on the parameter setting of the operators. The most desired control of such parameters pre...
Arthur Gonçalves Carvalho, Aluizio F. R. Ar...
ICDE
2000
IEEE
110views Database» more  ICDE 2000»
14 years 1 months ago
Optimal Index and Data Allocation in Multiple Broadcast Channels
The issue of data broadcast has received much attention in mobile computing. A periodic broadcast of frequently requested data can reduce the workload of the up-link channel and f...
Shou-Chih Lo, Arbee L. P. Chen
ICDAR
1999
IEEE
14 years 1 months ago
MergeLayouts: Overcoming Faulty Segmentations by a Comprehensive Voting of Commercial OCR Devices
In this paper, we will present a comprehensive voting approach, taking entire layouts obtained from commercial OCR devices as input. Such a layout comprises segments of three kind...
Stefan Klink, Thorsten Jäger