Search Results for "tsp c#"
Sort By:
Showing 17 open source projects for "tsp c#"
View related business solutions-
Permanently save time and money across the enterprise every day by giving users exactly the knowledge they need from all document sources with a click—without the hassle of launching and searching through hit lists and documents.
-
Pay business bills with bank transfers for free or pay by card, even where cards aren’t accepted.* There’s no monthly fee and your vendors don’t need to sign up.
-
1
GeneticSharp
GeneticSharp is a fast, extensible, multi-platform and multithreading
GeneticSharp is a fast, extensible, multi-platform and multithreading C# Genetic Algorithm library that simplifies the development of applications using Genetic Algorithms (GAs). Can be used in any kind of .NET 6, .NET Standard and .NET Framework apps, like ASP .NET MVC, ASP .NET Core, Blazor, Web Forms, UWP, Windows Forms, GTK#, Xamarin, MAUI and Unity3D games. GeneticSharp and extensions (TSP, AutoConfig, Bitmap equality, Equality equation, Equation solver, Function builder, etc). A Blazor... -
2
AntTSP
Traveling Salesman Problem (TSP) Solver
Fast Ant Colony Optimization TSP Solver -
3
Pharos
RTOS for Secure, Safe and Real-Time Systems
Pharos is a free open-source RTOS for secure, safe and real-time systems with the following characteristics: - Memory and enhanced time partitioning (TSP) - Native support for sporadic, periodic and aperiodic threads - Fixed-priority preemptive scheduler - Execution time protection (threads are prevented from executing for more time than they are configured to) - Small size (full image has ~100 to 300KiB text, ~30KiB data) - Hard real-time determinism - Fast critical sections... -
4
TSP Solver and Generator
Generate and solve Travelling Salesman Problem tasks
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 PDF... -
A GRC solution for technology-focused SMB and Enterprise Information Security teams. StandardFusion eliminates spreadsheet pain by using a single system of record. Identify, assess, treat, track and report on risks with confidence. Turn audit-based activities into a standardized process. Conduct audits with certainty and direct access to evidence. Manage compliance to multiple standards; ISO, SOC, NIST, HIPAA, GDPR, PCI-DSS, FedRAMP and more. Manage vendor and 3rd party risk, and security questionnaires easily in one place. StandardFusion is a Cloud-Based SaaS or on-premise GRC platform designed to make InfoSec compliance simple, approachable and scalable. Connect what your organization does, with what your organization needs to do.
-
5
Satsuma .NET Graph Library
a delicious .NET graph library
Satsuma is a graph library for .NET, written in C#. Satsuma is an easy-to-use and flexible library, which implements all the necessary graph structures, and the fastest possible graph algorithms. DOCUMENTATION: http://satsumagraph.sourceforge.net/ Satsuma is not a charting library. 'Graph' is used in the mathematical sense here (e.g. nodes connected with arcs). Satsuma is released under the zlib license. This license is very permissive and allows you to use Satsuma for both personal... -
6
AirTSP
Simulated Airline Travel Solution Provider Library
AirTSP is also named AirTSP (TSP standing for Travel Service Provider). That project aims at providing a clean API and a simple implementation, as a C++ library, of an Airline Schedule Management System. It is intended to be used in simulated environments only: it is not designed to work in the real-world of Airline IT operations. AirTSP/AirTSP makes an extensive use of existing open-source libraries for increased functionality, speed and accuracy. In particular the Boost (C++ Standard... -
7
TSPLib.Net
TSPLib wrapper for .Net
TSPLib is a set of Traveler Salesman and related graph problems gathered by the Heidelberg university. This project provides .Net library wrapping up library files loading code, implements distance functions and all the TSPLib features. If you'd like to test your graph tour searching algorithm on a TSP lib will save you hours of reading in a data and adjusting your code to ensure that result are comparable. Delivering as a dll with .Net wrapper and a zip archive with all the original... -
8
de-ess
De-essing software to reduce sibilance in speech using TSP
This de-esser uses a novel approach called Temporal Sibilance Processing. The idea is to distinguish between fricatives and voiced sections of the speech signal by the number of zero crossings in time. Most of the speech file is left untouched (the samples are directly copied from source to destination). Only fricatives that are long enough and loud enough are filtered. The advantage of this approach over traditional approaches is that the clarity of the remaining speech is completely unaffected. -
9
-
viewneo is a user-friendly, cloud-based solution that allows companies of all sizes to set up digital signage
-
10
software educativo de aplicacion de metaheuristicas sobre problemas de grafos, TSP problema del agente viajero, ruta mas corta, arbol de expansion minima, etc.
-
11
Solution to the Travelling Salesman Problem using Genetic Algorithms and the GALib library. The application logic is written in C# and interface in WPF. Requires .Net 4.0 beta 2 or above.
-
12
A solution of the Traveling Salesman Problem using the Simulated annealing.
-
13
-
14
A simple (~20 line python) O(n^6) algorithm for the traveling salesman problem that seems to do pretty well for most graphs; so well that I have not been able to find a graph which it does optimally solve. Those with spare cycles are welcome to help out.
-
15
A heuristic implementation for solving the Bottleneck Traveling Salesman Problem (BTSP) and related problems, such as the Maximum Scatter Traveling Salesman Problem (MSTSP).
-
16
-
17
GogoDroid
Android gogoc client
gogoc is a gateway6 client used on the host computer to connect to a tunnel broker using the TSP protocol and to get the information for its tunnel. When it receives the information for the tunnel, the Gateway6 client creates the static tunnel on its operating system. GogoDroid is an Android gogoc client.
- Previous
- You're on page 1
- Next