2297 search results - page 52 / 460 » A fast APRIORI implementation |
106
click to vote
EUROGP
2007
Springer
15 years 4 months ago
2007
Springer
As is typical in evolutionary algorithms, fitness evaluation in GP takes the majority of the computational effort. In this paper we demonstrate the use of the Graphics Processing...
CLUSTER
2003
IEEE
15 years 3 months ago
2003
IEEE
The use of Java for parallel programming on clusters according to the message-passing paradigm is an attractive choice. In this case, the overall application performance will larg...
CODES
2000
IEEE
15 years 2 months ago
2000
IEEE
During design exploration, many implementations of the same system specification may need to be evaluated. In this paper, we present an approach to construct sufficient and nece...
75
Voted
ANOR
2007
14 years 10 months ago
2007
We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same outpu...
JPDC
2006
14 years 10 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...