Sciweavers

929 search results - page 13 / 186
» heuristics 2008
Sort
View
ECAI
2010
Springer
14 years 11 months ago
Strengthening Landmark Heuristics via Hitting Sets
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
Blai Bonet, Malte Helmert
COR
1999
99views more  COR 1999»
14 years 9 months ago
Applications of modern heuristic search methods to pattern sequencing problems
This article describes applications of modern heuristic search methods to pattern sequencing problems, i.e., problems seeking for a permutation of the rows of a given matrix with r...
Andreas Fink, Stefan Voß
GRID
2008
Springer
14 years 10 months ago
A Launch-time Scheduling Heuristics for Parallel Applications on Wide Area Grids
Ranieri Baraglia, Renato Ferrini, Nicola Tonellott...
TSMC
2002
142views more  TSMC 2002»
14 years 9 months ago
Dynamics of local search heuristics for the traveling salesman problem
This paper experimentally investigates the dynamical behavior of a search process in a local heuristic search system for a combinatorial optimization problem. Or-opt heuristic algo...
Weiqi Li, Bahram Alidaee
COR
2006
75views more  COR 2006»
14 years 10 months ago
A new heuristic recursive algorithm for the strip rectangular packing problem
A fast and new heuristic recursive algorithm to find a minimum height for two-dimensional strip rectangular packing problem is presented. This algorithm is mainly based on heurist...
Defu Zhang, Yan Kang, Ansheng Deng