The Algorithm for Rearrangements in the Log2 (N, 0, p) Fabrics with an Odd Number of Stages.
Wojciech KabacinskiMarek MichalskiPublished in: ICC (2011)
Keyphrases
- learning algorithm
- computational complexity
- improved algorithm
- times faster
- worst case
- detection algorithm
- fixed number
- objective function
- computational effort
- np hard
- search space
- experimental evaluation
- execution times
- space complexity
- cost function
- k means
- recognition algorithm
- preprocessing
- probabilistic model
- expectation maximization
- theoretical analysis
- single scan
- small number
- upper bound
- computational cost
- optimal solution