1563 search results - page 172 / 313 » Performance comparison of memetic algorithms |
112
Voted
VRCAI
2006
ACM
15 years 9 months ago
2006
ACM
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
128
Voted
ICPP
2005
IEEE
15 years 9 months ago
2005
IEEE
We show how a series of transformations can be applied to a sequential program to obtain programs that represent successive steps in exploiting parallelism in the original algorit...
121
Voted
VLDB
2010
ACM
15 years 2 months ago
2010
ACM
The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...
121
Voted
DCC
2008
IEEE
16 years 3 months ago
2008
IEEE
We discuss the use of lattice vector quantizers in conjunction with a quadtree-based sorting algorithm for the compression of multidimensional data sets, as encountered, for examp...
161
Voted
ADC
2003
Springer
15 years 9 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...