Sciweavers

4342 search results - page 252 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
WEA
2007
Springer
114views Algorithms» more  WEA 2007»
15 years 11 months ago
Improving Tree Search in Phylogenetic Reconstruction from Genome Rearrangement Data
Abstract. A major task in evolutionary biology is to determine the ancestral relationships among the known species, a process generally referred as phylogenetic reconstruction. In ...
Fei Ye, Yan Guo, Andrew Lawson, Jijun Tang
IEEEHPCS
2010
15 years 4 months ago
Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
Benjamin Négrevergne, Alexandre Termier, Je...
WWIC
2005
Springer
197views Communications» more  WWIC 2005»
15 years 11 months ago
Reducing Memory Fragmentation with Performance-Optimized Dynamic Memory Allocators in Network Applications
The needs for run-time data storage in modern wired and wireless network applications are increasing. Additionally, the nature of these applications is very dynamic, resulting in ...
Stylianos Mamagkakis, Christos Baloukas, David Ati...
JSW
2006
78views more  JSW 2006»
15 years 5 months ago
Hybrid Genetic Algorithm for Design of Robust Communication Systems
A novel hybrid genetic algorithm (GA) for jointly optimizing source and channel codes is presented in this paper. The algorithm first uses GA for the coarse search of source and ch...
Chien-Min Ou, Jing-Jhih Chen, Wen-Jyi Hwang
150
Voted
RTCSA
1999
IEEE
15 years 9 months ago
Incorporating Error Recovery into the Imprecise Computation Model
In this paper; we describe optimal algorithmsfor incorporating error recovery in the imprecise computation model. In that model eack task compriser a mandatory and an optional par...
Hakan Aydin, Rami G. Melhem, Daniel Mossé