Sciweavers

1563 search results - page 77 / 313
» Performance comparison of memetic algorithms
Sort
View
KES
2004
Springer
14 years 2 months ago
FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases
Association rule mining is an important data mining problem that has been studied extensively. In this paper, a simple but Fast algorithm for Intersecting attribute lists using a ...
Jun Luo, Sanguthevar Rajasekaran
HPCC
2010
Springer
13 years 9 months ago
A Generic Algorithm Template for Divide-and-Conquer in Multicore Systems
The divide-and-conquer pattern of parallelism is a powerful approach to organize parallelism on problems that are expressed naturally in a recursive way. In fact, recent tools such...
Carlos H. Gonzalez, Basilio B. Fraguela
ISCOPE
1999
Springer
14 years 1 months ago
Generic Graph Algorithms for Sparse Matrix Ordering
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
CIKM
2003
Springer
14 years 2 months ago
XML parsing: a threat to database performance
XML parsing is generally known to have poor performance characteristics relative to transactional database processing. Yet, its potentially fatal impact on overall database perfor...
Matthias Nicola, Jasmi John
IPPS
2006
IEEE
14 years 2 months ago
Making lockless synchronization fast: performance implications of memory reclamation
Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace l...
Thomas E. Hart, Paul E. McKenney, Angela Demke Bro...