Sciweavers

432 search results - page 37 / 87
» An optimal algorithm for the distinct elements problem
Sort
View
ICS
2000
Tsinghua U.
13 years 11 months ago
Fast greedy weighted fusion
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
Ken Kennedy
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
14 years 28 days ago
Finding Building Blocks through Eigenstructure Adaptation
A fundamental aspect of many evolutionary approaches to synthesis of complex systems is the need to compose atomic elements into useful higher-level building blocks. However, the ...
Danica Wyatt, Hod Lipson
STOC
1994
ACM
125views Algorithms» more  STOC 1994»
13 years 11 months ago
A spectral technique for coloring random 3-colorable graphs (preliminary version)
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
Noga Alon, Nabil Kahale
CEC
2010
IEEE
13 years 8 months ago
Linear antenna array synthesis using fitness-adaptive differential evolution algorithm
-- Design of non-uniform linear antenna arrays is one of the most important electromagnetic optimization problems of current interest. In this article, an adaptive Differential Evo...
Aritra Chowdhury, Ritwik Giri, Arnob Ghosh, Swagat...
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
14 years 8 months ago
Allowing Privacy Protection Algorithms to Jump Out of Local Optimums: An Ordered Greed Framework
Abstract. As more and more person-specific data like health information becomes available, increasing attention is paid to confidentiality and privacy protection. One proposed mode...
Rhonda Chaytor