Sciweavers

1012 search results - page 51 / 203
» Segment intersection searching problems in general settings
Sort
View
GECCO
2009
Springer
125views Optimization» more  GECCO 2009»
15 years 8 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
152views Optimization» more  GECCO 2009»
15 years 8 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
ICMLA
2007
15 years 5 months ago
Phase transition and heuristic search in relational learning
Several works have shown that the covering test in relational learning exhibits a phase transition in its covering probability. It is argued that this phase transition dooms every...
Érick Alphonse, Aomar Osmani
ICPR
2006
IEEE
16 years 5 months ago
Detecting Text Lines in Handwritten Documents
Although detecting text lines in machine printed documents is typically considered a solved problem, it is still a challenge to segment handwritten text lines in the general sense...
Yi Li, Yefeng Zheng, David S. Doermann
174
Voted
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
13 years 6 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh