Sciweavers

1381 search results - page 142 / 277
» Structural signatures for tree data structures
Sort
View
IPPS
2010
IEEE
14 years 8 months ago
Meta-scheduling in advance using red-black trees in heterogeneous Grids
Abstract--The provision of Quality of Service in Grid environments is still an open issue that needs attention from the research community. One way of contributing to the provision...
Luis Tomás, Carmen Carrión, Blanca C...
CODES
2006
IEEE
15 years 4 months ago
The pipeline decomposition tree: : an analysis tool for multiprocessor implementation of image processing applications
Modern embedded systems for image processing involve increasingly complex levels of functionality under real-time and resourcerelated constraints. As this complexity increases, th...
Dong-Ik Ko, Shuvra S. Bhattacharyya
CPM
2005
Springer
109views Combinatorics» more  CPM 2005»
15 years 3 months ago
Using PQ Trees for Comparative Genomics
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a maximal permutation pattern was introduced in [12]....
Gad M. Landau, Laxmi Parida, Oren Weimann
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
15 years 1 months ago
Estimating the destructiveness of crossover on binary tree representations
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
Luke Sheneman, James A. Foster
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
14 years 4 months ago
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eri...