Search Results for "tree"

popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known...

...The LTS finite abstractions are shown to either simulate or to bisimulate the original MPL system. LTS models are to be verified against given specifications expressed as formulae in Linear Temporal Logic (LTL) and Computation Tree Logic (CTL). The toolbox intends to leverage the NuSMV model checker. Models are to be expressed in the C++ language. The abstraction procedure runs in C++. The generated LTS is exported to the NuSMV language. As such, it can be fed, along with a specification of interest, to the NuSMV model checker. If you are more familiar with JAVA language, we suggest you to try VeriSiMPL version 2.0 which is fully based on JAVA. ...

...Its parameters are sums of screen brightness (n color dimensions are optional) at concentric circles around each point, efficiently costing only the perimeter of those circles (instead of the area) because of the tree of squares. You can create any function, or to get started try the visual function editor where each click changes if a column is sine/sigmoid/half/double/exp/etc or which of the 0, 1, or 2 columns to the left are its params. Every click changes the patterns of waves seen on the left, which run that function you visually built at each point.

Realtime bigdata tool at the bit level based on immutable AVL forest which can be run in memory or, in future versions, as a merkle forest like a blockchain. Main object is a sparse bit string (Bits) that efficiently scales up to 2^63 bits normally compressed as forest has duplicated substrings. Bits objects support reading bit, byte, short, int, or long (Java primitives) at any bit index in 64 bit range. Example: instead of building a class to hold a header and then data, represent all of...

With this applet you'll be able to visualize formulas by building a tree with your mouse.

...The classes enable some ordered pairs to be stated, and will deduce all the other related ordered pairs implied by the relation's properties. There are implementations of transitive, reflexive-and-transitive, and symmetric-reflexive-and-transitive (equivalence) relations using hash sets and tree sets. 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.

A simple but effective parser for mathematical function that produces a tree to represent them.

To help math students visualize the prufer code and/or discover anything new about the prufer code not already present. Examples and live applet on webiste.

A project to help students calculate symbolic derivatives and integrals. Plus, a Java expression tree library for developers who may need to do such things in their programs. The project has moved to github: https://github.com/generalpenguin89/calchelper

Parser for mathematical expressions written in Java. Expressions may contain variables, functions and constants. The parser turns a string argument into an expression tree, which then can be evaluated.