Sciweavers

1563 search results - page 90 / 313
» Performance comparison of memetic algorithms
Sort
View
CVPR
2008
IEEE
14 years 11 months ago
Classification and evaluation of cost aggregation methods for stereo correspondence
In the last decades several cost aggregation methods aimed at improving the robustness of stereo correspondence within local and global algorithms have been proposed. Given the re...
Federico Tombari, Stefano Mattoccia, Luigi di Stef...
WIA
2007
Springer
14 years 3 months ago
Accelerating Boyer Moore Searches on Binary Texts
The Boyer and Moore (BM) pattern matching algorithm is considered as one of the best, but its performance is reduced on binary data. Yet, searching in binary texts has important a...
Shmuel Tomi Klein, Miri Ben-Nissan
ESCIENCE
2006
IEEE
14 years 3 months ago
Hybrid Particle Guide Selection Methods in Multi-Objective Particle Swarm Optimization
This paper presents quantitative comparison of the performance of different methods for selecting the guide particle for multi-objective particle swarm optimization (MOPSO). Two p...
David Ireland, Andrew Lewis, Sanaz Mostaghim, Junw...
JCST
2006
65views more  JCST 2006»
13 years 9 months ago
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
Katerina Asdre, Stavros D. Nikolopoulos
IISWC
2006
IEEE
14 years 3 months ago
Performance Analysis of Sequence Alignment Applications
— Recent advances in molecular biology have led to a continued growth in the biological information generated by the scientific community. Additionally, this area has become a m...
Friman Sánchez, Esther Salamí, Alex ...