Search Results for "trees"

"Next Generation Programming - Programming Without Coding Software" is a drag-drop wizard for creating simple or complex applications without writing any programming language code The Software is coded/designed with "Java Programming Language" for novice/expert programmers; Programmers can write softwares with visual tools : drag-drop components;visual editors... Programmers can use the software to compose of simple/complex applications : Database programs, circuit design, generate...

...KB3 is based on the FIGARO reliability modeling language, suitable for describing CTMC (continuous time Markov chains), DES (discrete event simulation) models, and for automatic generation of fault trees. FIGARO is objet oriented, close to natural language and enables building libraries of reusable components (knowledge bases). Go to "Files" tab to download various Figaro based tools (Visual Figaro, KB3, YAMS), lots of examples and documentation.

Exchange-core is an open-source market exchange core based on LMAX Disruptor, Eclipse Collections (ex. Goldman Sachs GS Collections), Real Logic Agrona, OpenHFT Chronicle-Wire, LZ4 Java, and Adaptive Radix Trees. Designed for high scalability and pauseless 24/7 operation under high-load conditions and providing low-latency responses. Single order book configuration is capable to process 5M operations per second on 10-years old hardware (Intel® Xeon® X5690) with moderate latency degradation. HFT optimized. Priority is a limit-order-move operation mean latency (currently ~0.5µs). ...

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

MSTParser is a non-projective dependency parser that searches for maximum spanning trees over directed graphs. Models of dependency structure are based on large-margin discriminative training methods. Projective parsing is also supported. mstparser 0.5.1 is now available via Maven Central. If you use Maven as your build tool, then you can add it as a dependency in your pom.xml file: <dependency> <groupId>net.sourceforge.mstparser</groupId> <artifactId>mstparser</artifactId> <version>0.5.1</version> </dependency>

Java Behaviour Trees is a Java framework for easily building and running generic behaviour trees. Here, "behaviour tree" refers to the technique used to control the behaviour of characters in video games. IMPORTANT NOTE: our source code has been moved to GitHub. You will find it at: https://github.com/gaia-ucm/jbt Note however that all the binary files will still be distributed here at SourceForge.

Conversion between different grammar frameworks is of great importance to comparative performance analysis of the parsers developed on them. This tool can convert CCG derivations to PTB trees by using Max Entropy models as well as visualizing the tree graphs. The main technical innovation presented here is the effective conversion method which achieves a F score over 95%.

A Java API for using suffix trees with natural language and an Eclipse/SWT-based GUI for suffix tree visualization using Graphviz.

JMiner is a (not yet!) complete data mining and artificial intelligence solution written in Java. Support for neural networks, genetic algorithms/programming, decision trees, clustering, market basket analysis, link analysis, data cleansing, and others.

Automated Theorem Prover implemented in Java and using clause trees. This software will be able to read mathematical theorems from TPTP and prove or disprove them.