Search Results for "parallel-sudoku-solver"

TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as...

We are a groupe of students in computer science. This is a project of our studies : a cross-platform Sudoku game written in C++, using the Qt Framework. The project is under GPL licence.

Adds a new Controller to JMeter, supporting the definition of probabilistic user behavior. Moreover, it enables the variation of the number of active parallel user sessions (threads) during test run to be specified by configurable mathematic formulae.

This project aims to create a framework on which java applications can run in parallel on multiple nodes. A master server dispatches the jobs and makes all planning regarding memory management.