Package jline.lib.perm
Matrix permanent computation algorithms.
This package provides efficient algorithms for computing matrix permanents, used in various queueing network analysis methods.
See: Description
-
Class Summary Class Description AdaPartSampler Sampling method to approximate the permanent using Adaptive Partitioning (AdaPart). BethePermanent Implementation of Sum Product Algorithm (SPA) to approximate the Bethe permanent. HeuristicPermanent Heuristic approximation to the permanent of a positive matrix. HuberLawSampler Sampling method to approximate the permanent using the Huber-Law bound. NaivePermanent Implementation of the naive exact permanent computation. PermSolver Abstract base class for permanent computation solvers. Permanent Implementation of the MATLAB perm.m permanent computation algorithm. NetworkNoThink Queueing network model without think time. NetworkThink Queueing network model with think time. RyzerPermanent Implementation of Ryzer's algorithm to calculate the permanent. PermExampleKt QueueingNetworkKt