Sciweavers

25041 search results - page 4233 / 5009
» Algorithms for Clustering Data
Sort
View
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
15 years 11 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
AUSAI
2001
Springer
15 years 11 months ago
Further Pruning for Efficient Association Rule Discovery
The Apriori algorithm's frequent itemset approach has become the standard approach to discovering association rules. However, the computation requirements of the frequent item...
Songmao Zhang, Geoffrey I. Webb
CASES
2001
ACM
15 years 11 months ago
A compiler framework for mapping applications to a coarse-grained reconfigurable computer architecture
The rapid growth of silicon densities has made it feasible to deploy reconfigurable hardware as a highly parallel computing platform. However, in most cases, the application needs...
Girish Venkataramani, Walid A. Najjar, Fadi J. Kur...
PNPM
1987
15 years 11 months ago
Stochastic Petri Net Analysis of a Replicated File System
We present a stochastic Petri net model of a replicated file system in a distributed environment where replicated files reside on different hosts and a voting algorithm is used to...
Joanne Bechta Dugan, Gianfranco Ciardo
CIKM
2009
Springer
15 years 10 months ago
Effective, design-independent XML keyword search
Keyword search techniques that take advantage of XML structure make it very easy for ordinary users to query XML databases, but current approaches to processing these queries rely...
Arash Termehchy, Marianne Winslett
« Prev « First page 4233 / 5009 Last » Next »