Search Results for "algorithms" - Page 2

Moved to GitHub https://github.com/fedups Algebraic equation processing at run time for Java programs. Supports variables, functions with parameters, rate table lookups, an embedded "if" function... Infinitely extensible, very small footprint.

Operations Research EXperiment Framework for Java

Abandoned version of qbc. DOES NOT WORK properly

Semantic query optimization (SQO) is the process of finding equivalent rewritings of an input query given constraints that hold in a database instance. We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity...

QMC Logic Minimizer is a versatile application for fast simplifying truth and reduce lines tables. This program offers a comfortable user interface for generating and minimizing of the combinational logic functions. It is unique for its possibility of minimizing several functions at the same time. This program is intended for practical digital devices constructors as well as formal scholars and academics. Features: - You can minimize up to 16 input variables and up to 16 output...

compare time of process between rsa and elgamal algorithm used to encryption and digital signature.

JECL, pronounced "Jekyll", is an open-source Java library implementing a variety of evolutionary algorithms. The goal is to provide a uniform interface for describing problems, running evolutionary algorithms, and accumulating results. The Java Evolutionary Computation Library is no longer under active development. We suggest the MOEA Framework (http://www.moeaframework.org/), jMetal (http://jmetal.sourceforge.net/), ECJ (http://cs.gmu.edu/~eclab/projects/ecj/) or JGAP (http://jgap.sourceforge.net/) as alternatives.

..."Efficiently computing a linear extension of the sub-hierarchy of a Concept Lattice" by Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret and Jeremy P. Spinrad. "Performances of Galois Sub-hierarchy-building algorithms" by Gabriela Arevalo, Anne Berry, Marianne Huchard, Guillaume Perrot and Alain Sigayret In you're in need of other GSH algorithms or their realizations in C++, you might want to investigate a project called Galicia on sourceforge. This program is free software and is licensed under GNU General Public License as published by the Free Software Foundation. ...

...The current version (0.1) has been tested but not substantially used. Feedback from use in the field will be welcomed, as will offers of collaboration to improve the deduction algorithms.

visualFSA is a small tool which lets you construct NFAs/DFAs [(non)deterministic finite automata]. It offers some common algorithms which can be applied to that automatons, like converting NFA -> DFA, word problem, accepted language etc.

Zero Sum Game Solver Java Library is open source java library to solve 2-player finite zero-sum games. This programs solve zero-sum games with linear programming.

Geom4J is a computational geometry library for Java. It contains implementation of the most important computational geometry data structures and algorithms coded in pure Java, designed for ease of use and optimized for performance.

The final build of this software now is distributed in R, embedded in "RedeR': an R/Bioconductor package for hierarchical and nested network analysis... more about RedeR: http://bioconductor.org/packages/2.9/bioc/html/RedeR.html

swIMP (swig-based Interfaces for Mathematical Programming) provides Java wrappers for solvers written in C or C++. The current focus is on accessing OSI-compatible linear programming (LP) solvers from the Coin-OR-project (e.g. Clp, GLPK, MOSEK, CPLEX).

Parallel Colt is a multithreaded version of Colt - a library for high performance scientific computing in Java. It contains efficient algorithms for data analysis, linear algebra, multi-dimensional arrays, Fourier transforms, statistics and histogramming

Algorithms that optimally & efficiently map atomic reactions. See 1) Atomic Reaction Mapping {Crabtree: amazon, b&n} 2) J. of Exp. Algorithmics, Vol 13 {Crabtree, Mehta} 3) J. Chem. Inf. Model., 2010, 50 (9), pp 1751–1756 {Crabtree, Mehta, Kouri}.

A java project to create a library that can calculate decompression schemes for diving. Different open source algorithms can be chosen to use for the calculation. For example Bühlmann and VPM.

A simple calculator to help with the math operations required by cryptographic algorithms like RSA and El Gamal.

A Java library and set of tools to quickly and easily manipulate graphs (set of nodes and edges) and dynamic graphs. The principal trait of this library is its ability to manage (create, edit, layout, display) continuously evolving graphs. The development of this project now takes place on Github. Visit the official Graphstream website at http://graphstream-project.org

Don't hard-code data-structures for Artificial Intelligence (AI). Evolve them (and control flow) as cycles of arrays in arrays with size constraints based on other array sizes (at specific index) in terms of range, multiply, exponent, or permutation. No working code yet. Whats there now is an extension of GigaLineCompile which would become part of Human AI Net, but there are other projects to finish before I can come back to this one.

Java library that implements linear algebra operations: matrix operations (addition, substraction, multiplication, transposing, determinant of matrix , inversion, rank of matrix); linear equations system solving.

Java Metaheuristics (JMH) is a Java library aimed at the design and implementation of exact and approximated algorithms for optimization problems. JMH is specifically tailored for the design of metaheuristic procedures.

Software for graphs visualization, encouraging graph algorithms implementation. Aimed at students who want to code their own algorithms and see a graphical representation of it working.

Fuzzy numbers and basic fuzzy arithmetics (+, -, *, /, 1/x) implementation written in Java. Should be used as a library, but it also has a GUI which demonstrates its capabilities (using SWT widgets).

G.A.V. (Graph Algorithm Visualizer) is a tool that visualizes algorithms from graph theory. A step-by-step visualization from each different algorithm allows the user to understand the particular algorithm very easily.