Search Results for "k-stor"

LINE is an open-source software package to analyze queueing models via analytical methods and simulation. The solver is available for Java/Kotlin, MATLAB, and Python. LINE features algorithms for the solution of open queueing systems (e.g., M/M/1, M/M/k, M/G/1, ...), open and closed queueing networks, and layered queueing networks. Additional details are available on the project website: http://line-solver.sf.net.

QueueSimulator is a free software which aims to simulate primarily G/G/k queueing systems that are used in computer networks. But it can be used to simulate practically any stable queue system.

MuLaViTo is a multi-layer visualization framework which allows to visualize relations between multiple graphs in derived applications. Moreover, it provides helpful means like k-shortest path algorithms, running algorithms in a separate thread, ...

This project concerns K-MADe (Kernel of Model for Activity Description environment), a tool for contributing to the incorporation of ergonomics into the interactive systems design process, through task and activity analysis.

SimulME is a Java ME (J2ME) application with Queueing calculator, Stopwatch, Monte Carlo simulation, Random Number Generator (RNG), Probability distributions, Kolmogorov-Smirnov and Chi-square tests. It works with MIDP 2.0 and CLDC 1.1 profiles.

Algorithms to estimate the number of k-colorings of a low-degree graph using samplings from a markov chain are provided.

Two Markov-Chain-Monte-Carlo-algorithms ("Glauber Dynamics" and "Flip Dynamics") used for randomly sampling k-colorings of a graph.