Sciweavers

14548 search results - page 419 / 2910
» The Optimal Path-Matching Problem
Sort
View
ICPR
2010
IEEE
15 years 7 months ago
The Problem of Fragile Feature Subset Preference in Feature Selection Methods and a Proposal of Algorithmic Workaround
Abstract—We point out a problem inherent in the optimization scheme of many popular feature selection methods. It follows from the implicit assumption that higher feature selecti...
Petr Somol, Jiri Grim, Pavel Pudil
DISOPT
2008
93views more  DISOPT 2008»
15 years 6 months ago
Exploiting planarity in separation routines for the symmetric traveling salesman problem
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
Adam N. Letchford, Nicholas A. Pearson
COR
2006
88views more  COR 2006»
15 years 6 months ago
An exact algorithm for the capacitated vertex p-center problem
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 to them within capacity restrictions in order to minimize the max...
F. Aykut Özsoy, Mustafa Ç. Pinar
TVLSI
2008
90views more  TVLSI 2008»
15 years 6 months ago
A Special-Purpose Architecture for Solving the Breakpoint Median Problem
Abstract--In this paper, we describe the design for a co-processor for whole-genome phylogenetic reconstruction. Our current design performs a parallelized breakpoint median comput...
Jason D. Bakos, Panormitis E. Elenis
CCE
2004
15 years 6 months ago
Part II. Future perspective on optimization
Following from part I, which presents a retrospective on optimization, we focus here on areas that are recent active research topics and are likely to strongly influence the futur...
Ignacio E. Grossmann, Lorenz T. Biegler