319 search results - page 33 / 64 » An Analytical Comparison of Optimization Problem Generation ... |
GECCO
2005
Springer
14 years 28 days ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
JEA
2006
13 years 7 months ago
2006
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
FCCM
1999
IEEE
13 years 11 months ago
1999
IEEE
This paper presents a method, called multiple constant multiplier trees MCMTs, for producing optimized recon gurable hardware implementations of vector products. An algorithm for ...
CCECE
2006
IEEE
14 years 1 months ago
2006
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...
ICNS
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— The study of protocol behavior and traffic characteristics in a simulated environment is commonly supported by ad-hoc or general purpose simulators (e.g., Opnet, NS-2)...