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...
Jadabs is a dynamic lightweight container for small devices in a distributed environment. Many distributed infrastructures exists so fare like Jini, Jxta, Messaging Systems, etc. All of them lack so fare the possibility to be run on small devices.
A universal navigation system for most kind of mobile phones, smartphones, portables and laptops for different kind of navigation: car/bicycle/pedestrian navigation, geocaching and maybe more.
Deploy in 115+ regions with the modern database for every enterprise.
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
TacitPixel is a scalable C++ framework for building application prototypes for interactive collaborative VR/AR applications. It provides a number of features that make prototyping fast and portable.
TacitPixel is the successor of the TAP and Twisted Pair engines.