Search Results for "java branch and bound"

OpenJUMP is a community driven fork of JUMP the "Java Unified Mapping Platform" GIS software. The original JUMP was developed by Vivid Solutions, released under GPL2 in 2003 and discontinued in 2006. During 2004 already some enthusiastic developers joined together to enhance further the features of JUMP. They launched an independent development branch called OpenJUMP. The name gives credit to the original JUMP development, and at the same time describes the objectives of this project...

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...

Netlist database and manipulation API with interfaces to Java and Ruby. Verilog netlist inputs are supported. Project branch continues to evolve: https://github.com/gburdell/nldb including addition of tclsh UI.

AbuGraph is a freely available Java application for the layout and visualization of directed graphs. Bound to a TCP port, it supports dynamic graph creation receiving commands from a telnet console or another third party application.

ABPS - Advanced Branch Prediction Simulator - allows: branch prediction simulation using multiple predictors (GAg,PAg,PAp,GShare,Perceptron) and detection of unbiased branches. Results can be seen using charts. Used benchmarks: Stanford, SPEC2000, CBP2.

The Cryptix ASN.1 Kit aims at facilitating the task programmers face in coding, accessing and generating java-bound, both types and values, defined as ASN.1 constructs, or encoded as such.