1120 search results - page 54 / 224 » Parallel Algorithmic Techniques for Combinatorial Computatio... |
PPOPP
2005
ACM
15 years 3 months ago
2005
ACM
The goal of data mining algorithm is to discover useful information embedded in large databases. Frequent itemset mining and sequential pattern mining are two important data minin...
PPL
2010
14 years 4 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
107
click to vote
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
118
click to vote
CISIS
2011
IEEE
13 years 9 months ago
2011
IEEE
—Computational performance increasingly depends on parallelism, and many systems rely on heterogeneous resources such as GPUs and FPGAs to accelerate computationally intensive ap...
CPE
1998
Springer
15 years 2 months ago
1998
Springer
We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...