Sciweavers

183 search results - page 9 / 37
» Geometric Optimization Problems Over Sliding Windows
Sort
View
ICDM
2006
IEEE
135views Data Mining» more  ICDM 2006»
14 years 2 months ago
Discovering Frequent Poly-Regions in DNA Sequences
The problem of discovering arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence, is studied, and two efficient approaches are propose...
Panagiotis Papapetrou, Gary Benson, George Kollios
ECCV
2010
Springer
12 years 2 months ago
Voting by Grouping Dependent Parts
Hough voting methods efficiently handle the high complexity of multiscale, category-level object detection in cluttered scenes. The primary weakness of this approach is however t...
Pradeep Yarlagadda, Antonio Monroy and Bjorn Ommer
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
ECCV
2008
Springer
14 years 6 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
HM
2009
Springer
145views Optimization» more  HM 2009»
14 years 1 months ago
Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows
Abstract. In this work we extend a VNS for the periodic vehicle routing problem with time windows (PVRPTW) to a multiple VNS (mVNS) where several VNS instances are applied cooperat...
Sandro Pirkwieser, Günther R. Raidl