Sciweavers

1182 search results - page 46 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
ICDAR
2003
IEEE
15 years 7 months ago
A Matching Scheme to Enhance Performance Evaluation of Raster-to-Vector Conversion Algorithms
This paper deals with performance evaluation of rasterto-vector conversion algorithms. We briefly review the past work, and focus our attention on a method proposed by Phillips a...
Xavier Hilaire
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
15 years 3 months ago
A hybrid method for tuning neural network for time series forecasting
This paper presents an study about a new Hybrid method GRASPES - for time series prediction, inspired in F. Takens theorem and based on a multi-start metaheuristic for combinatori...
Aranildo Rodrigues Lima Junior, Tiago Alessandro E...
MVA
1998
230views Computer Vision» more  MVA 1998»
15 years 3 months ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...
IJKESDP
2010
149views more  IJKESDP 2010»
15 years 11 days ago
An approximate solution method based on tabu search for k-minimum spanning tree problems
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishiz...
IPPS
2010
IEEE
14 years 11 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...