Sciweavers

4816 search results - page 101 / 964
» Performance analysis of the AntNet algorithm
Sort
View
149
Voted
CASCON
1996
89views Education» more  CASCON 1996»
15 years 6 months ago
A comparison of algorithms for interprocedural class analysis
Message passing overhead is often a substantial source of runtime overhead in object-oriented applications. To combat this performance problem, a number of techniques have been de...
David Grove
165
Voted
PR
2008
129views more  PR 2008»
15 years 4 months ago
A comparison of generalized linear discriminant analysis algorithms
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
Cheong Hee Park, Haesun Park
130
Voted
GECCO
2006
Springer
174views Optimization» more  GECCO 2006»
15 years 8 months ago
On the analysis of the (1+1) memetic algorithm
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
Dirk Sudholt
ICPP
2006
IEEE
15 years 11 months ago
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
David A. Bader, Kamesh Madduri
ASPDAC
2006
ACM
101views Hardware» more  ASPDAC 2006»
15 years 11 months ago
Worst case execution time analysis for synthesized hardware
- We propose a hardware performance estimation flow for fast design space exploration, based on worst-case execution time analysis algorithms for software analysis. Test cases on s...
Jun-hee Yoo, Xingguang Feng, Kiyoung Choi, Eui-You...