[edit] Parallel algorithms
Berkman, Schieber & Vishkin (1993) showed how to solve the all nearest smaller values problem efficiently on a concurrent-read concurrent-write Parallel Random Access Machine.
Jean-Marc Adamo: Data Mining for Association Rules and Sequential Patterns: Sequential and Parallel Algorithms
Theophano Mitsa: Temporal Data Mining
Zhengxin Chen: Intelligent Data Warehousing - From Data Preparation to Data Mining ...
In order to prove that a given problem is P-complete, one typically tries to reduce a known P-complete problem to the given one, using an efficient parallel algorithm.
Problems not known to be P-complete ...
That said, implementations that are combinatorial in nature, rather than matrix based have advantages in some cases (like Johnson assumed), may have many benefits. This has become a challenge for many researchers, and some nice parallel algorithms ...
 See also: Complexity, Heuristics, Neural network, Genetic algorithm, Artificial intelligence
  
|
RSS
