Package jline.lib.perm

package jline.lib.perm
Port of permanent computation algorithms for matrix permanents.

This package provides efficient algorithms for computing matrix permanents, which are used in certain queueing network calculations.

Since:
LINE 2.0
  • Classes
    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.
    NetworkNoThink
    Queueing network model without think time.
    NetworkNoThink.MarginalResult
    Triple of (probability, computation time, memory usage).
    NetworkThink
    Queueing network model with think time.
    Permanent
    Implementation of the MATLAB perm.m permanent computation algorithm.
    PermExample
    Example usage of the permanent computation algorithms.
    PermSolver
    Abstract base class for permanent computation solvers.
    QueueingNetwork
    Top-level utilities for the queueing-network permanent computations.
    RyzerPermanent
    Implementation of Ryzer's algorithm to calculate the permanent.