Sciweavers

975 search results - page 34 / 195
» Locality Optimization for Program Instances
Sort
View
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
14 years 10 months ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Thibaut Lust
WABI
2005
Springer
109views Bioinformatics» more  WABI 2005»
15 years 3 months ago
Optimal Protein Threading by Cost-Splitting
Abstract. In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignme...
Philippe Veber, Nicola Yanev, Rumen Andonov, Vince...
PAMI
2006
156views more  PAMI 2006»
14 years 9 months ago
Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
Yefeng Zheng, David S. Doermann
OOPSLA
2010
Springer
14 years 8 months ago
An input-centric paradigm for program dynamic optimizations
Accurately predicting program behaviors (e.g., locality, dependency, method calling frequency) is fundamental for program optimizations and runtime adaptations. Despite decades of...
Kai Tian, Yunlian Jiang, Eddy Z. Zhang, Xipeng She...
LION
2009
Springer
115views Optimization» more  LION 2009»
15 years 4 months ago
Flexible Stochastic Local Search for Haplotype Inference
Abstract. Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genoty...
Luca Di Gaspero, Andrea Roli