Secure by design, portable by default. Recover clean, fast, anywhere. Start a free trial.
Try Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
Try it Free
$300 Free Credits to Build on Google Cloud
New customers can spin up VMs, build with AI, and query data at no cost.
Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
Refix solves the problem of binary dependency management in .NET solutions. Refix is the only binary you'll need to commit to your source code repository!
Remote Desktop server/client (proprietary protocol) (written in java)
jVNCLite is a Java VNC server/client. Uses it's own proprietary protocol (not RFB). Server uses JNI and requires Microsoft Windows system. Client is 100% java. Only one problem left with some multi-monitor systems.
The 8-puzzle problem is a puzzle popularized by Sam Loyd in the 1870s. It is played on a 3-by-3 grid with 8 square blocks labeled 1 through 8 and a blank square. Your goal is to rearrange the blocks so that they are in order.
The aim of the PL-PSF project is to create a generic domain-independent combinatorial problem solver. It uses a petri-nets based model to represent the problems and problem decomposition/abstraction with graph topology analysis to solve them.
CodingTools Plugin for Eclipse. A few code fixing tools. Converts System.out style logging to logging framework calls. Provides Problem markers and QuickFixes for the same.
This is a tool that converts the problems in the software Go Elementary Training and Dan Level Testing to SGF. This enables you to use them in your favourite problem solving program such as GoGrinder etc.
This is a tool that converts the problems in the software Tesuji Made Easy to SGF. This enables you to use them in your favourite problem solving program such as GoGrinder etc. Tesuji Made Easy is a program for practicing tactics in the game of Go.
This is a tool that converts the problems in the software Fuseki Made Easy to SGF. This enables you to use them in your favourite problem solving program such as GoGrinder etc. Fuseki Made Easy is a program that is designed to practice the opening st
This is a tool that downloads all problems from http://igo.web.infoseek.co.jp/cgi-bin/mondai/mondai.htm and saves them in sgf format. This enables you to use them in your favourite problem solving program such as GoGrinder etc.
...aims to create a community platform for collaborative problem solving. The project itself is an experiment for social collaboration between a large user-base, but we aim to make the platform scalable for small organizations.
This project was created at the University of Applied Sciences in Saarbrücken/Germany for the subject "Distributed Systems". It provides a client-server-structure to compute a complex mathematical problem in a distributed network.
This project contains a way to test a JSF managed bean in the context of a spring integration test, resolving the session scopes problem and emulating a faces context
Solver for the Data Compaction Problem (dcp) for static test compaction and some specific bionformatic issues. Contains code, charts, tables and test data.
This is a school project, it main purpose is to provide the basic functionality for a online help desk, a system that allows users to create tickets containing their problem description to be attended by an IT technician.
For users of the Samsung SC-MX20, this little program fixes the wide screen problem and gives the option to convert video files to a Windows Movie Maker friendly format. From http://samsungscmx20.blogspot.com
The CoreBots library is a set of components for robots. The library adresses the command and control layer, and the localization and mapping problem. It is intended to run on the CoreBots at Ecole des Mines and/or on the WifiBots.
Our goal is to develop a full working solver for ATA (with 1 clock) in Python, with MTL to ATA support. The decidability for the emptiness problem was proposed by Lasota and Walukiewicz. The MTL to ATA was proposed by Ouaknine and Worrell.