Search Results for "tree"
Sort By:
Showing 32 open source projects for "tree"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Context for your AI agentsBuild data pipelines that feed your AI models and agents without managing infrastructure. Crawl any website, transform content, and push directly to your preferred vector store. Use 10,000+ tools for RAG applications, AI assistants, and real-time knowledge bases. Monitor site changes, trigger workflows on new data, and keep your AIs fed with fresh, structured information. Cloud-native, API-first, and free to start until you need to scale.
-
1
chessPDFBrowser
Chess application whichs allows working with chess PDF books and PGNs.
Chess application which allows working with PDFs and PGNs. You can work with the chess games of the PDF and edit their tree of variants. Graphical environment. Standard PGN TAGs. PGN comments. Ocr like (Fen string detection from chess board position images). Connection to Uci chess engines (like stockfish). Position analysis, full game analysis. You can now play games against uci engines. pdf2pgn command line command included. Detailed documentation. -
2
ADAMS
ADAMS is a workflow engine for building complex knowledge workflows.
ADAMS is a flexible workflow engine aimed at quickly building and maintaining data-driven, reactive workflows, easily integrated into business processes. Instead of placing operators on a canvas and manually connecting them, a tree structure and flow control operators determine how data is processed (sequentially/parallel). This allows rapid development and easy maintenance of large workflows, with hundreds or thousands of operators. Operators include machine learning (WEKA, MOA, MEKA) and image processing (ImageJ, JAI, BoofCV, LIRE and Gnuplot). R available using Rserve. ... -
3
Next Generation Programming
Compose Software Without Writing Any Programing Code
"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... -
4
Java generic API for search algorithms on graphs implicitly given by tree node expansion operator
-
Cloud-based help desk software with ServoDeskWhat if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
-
5
...Obtaining the teachingbox: FOR USERS: If you want to download the latest releases, please visit: http://search.maven.org/#search|ga|1|teachingbox FOR DEVELOPERS: 1) If you use Apache Maven, just add the following dependency to your pom.xml: <dependency> <groupId>org.sf.teachingbox</groupId> <artifactId>teachingbox-core</artifactId> <version>1.2.3</version> </dependency> 2) If you want to check out the most recent source-code: git clone https://git.code.sf.net/p/teachingbox/core teachingbox-core Documentation: https://sourceforge.net/p/teachingbox/documentation/HEAD/tree/trunk/manual/
-
6
popt4jlib
Parallel Optimization Library for Java
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... -
7
MYRA
A collection of ACO algorithms for the data mining classification task
MYRA is a collection of Ant Colony Optimization (ACO) algorithms for the data mining classification task. It includes popular rule induction and decision tree induction algorithms. The algorithms are ready to be used from the command line or can be easily called from your own Java code. They are build using a modular architecture, so they can be easily extended to incorporate different procedures and/or use different parameter values. This project is now hosted at: https://github.com/febo/myra -
8
physicsmata
API for all possible cellular automata that work same at all angles
...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. -
9
This site contains four packages of Mass and mass-based density estimation. 1. The first package is about the basic mass estimation (including one-dimensional mass estimation and Half-Space Tree based multi-dimensional mass estimation). This packages contains the necessary codes to run on MATLAB. 2. The second package includes source and object files of DEMass-DBSCAN to be used with the WEKA system. 3. The third package DEMassBayes includes the source and object files of a Bayesian classifier using DEMass. DEMassBayes.7z has jar file to be used with WEKA and a readme file listing parameters used. ...
-
eProcurement SoftwareeBuyerAssist by Eyvo is a cloud-based procurement solution designed for businesses of all sizes and industries. Fully modular and scalable, it streamlines the entire procurement lifecycle—from requisition to fulfillment. The platform includes powerful tools for strategic sourcing, supplier management, warehouse operations, and contract oversight. Additional modules cover purchase orders, approval workflows, inventory and asset management, customer orders, budget control, cost accounting, invoice matching, vendor credit checks, and risk analysis. eBuyerAssist centralizes all procurement functions into a single, easy-to-use system—improving visibility, control, and efficiency across your organization. Whether you're aiming to reduce costs, enhance compliance, or align procurement with broader business goals, eBuyerAssist helps you get there faster, smarter, and with measurable results.
-
10
FENNIX
Fast EXperimentation with Neural Networks
FENNIX is a simulator of artificial neural networks written in Java. It allows you to easily describe a complete simulation by using a simple text script language or by adding nodes to a tree of tasks by using the graphical used interface. Moreover, FENNIX is composed of pluggable tools that can be easily modified in order to add new functionalities to the simulator. -
11
Immutable Sparse Wave Trees (WaveTree)
Realtime bigdata tool for bit strings up to 2^63 based on AVL forest
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... -
12
S-Match
S-Match is a semantic matching framework.
S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. -
13
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.
-
14
TreeLiker
TreeLiker is a collection of fast algorithms for working with complex
...In experiments with real-life data, the algorithms were shown to be able to construct complete non-redundant sets of patterns for chemical datasets involving several thousands of molecules as well as for comparably large datasets from genomics or proteomics. The included relational learning algorithms are tailored towards so-called tree-like features for which some otherwise very hard sub-problems (NP-hard) become tractable. -
15
JBoost is a simple, robust system for classification. JBoost contains implementations of several boosting algorithms in an alternating decision tree framework. In addition, JBoost provides extensible software for adding more learning algorithms.
-
16
SweetOnionCCG2PTBConverter
A tool that converts CCGBank to PTB
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%. -
17
GPalta is a genetic programming toolbox that aims for simplicity and speed. It features tree-based genetic programming, optional strong typing, a GUI to control an evolution process (allows to save and continue later) and easy interoperability with Matlab
-
18
-
19
A java-swing application that provides a tree-view of a jena rdf-graph. This is a tool for developers utilizing jena or pellet who wish to see what is going on within their jena-model when inference occurs.
-
20
Sanchay is a collection of tools and APIs for language researchers. It has some implementations of NLP algorithms, some flexible APIs, several user friendly annotation interfaces and Sanchay Query Language for language resources.
-
21
Compiler of a 0+ order rule system. From a ruleset using attribute value formalism a decision tree is build and java/C/C++ execution code will be generated.
-
22
Highly reusable and extensible Decision-Tree (Max-Gain) framework comprising of comprehensive input-processing and display functionality. Handles nominal, linear, continuous data. For preliminary description, refer - http://sushain.com/blog/archives/
-
23
Genetic Programming (tree structure) predictor within Weka data mining software for both continuous and classification problems.
-
24
The Decision Tree Learning algorithm ID3 extended with pre-pruning for WEKA, the free open-source Java API for Machine Learning. It achieves better accuracy than WEKA's ID3, which lacks pre-pruning.Info: http://bruno-wp.blogspot.com/search/label/Softwar
-
25
We provide here a tree constraint for the Choco (choco.sourceforge.net) Constraint Programming Solver.
