Search Results for "cvs version tree"
Sort By:
Showing 25 open source projects for "cvs version tree"
View related business solutions-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
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. Multilanguage... -
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)... -
3
Java generic API for search algorithms on graphs implicitly given by tree node expansion operator
-
4
...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/
-
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
5
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... -
6
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 -
7
physicsmata
API for all possible cellular automata that work same at all angles
Its strange how the "sorted pointers" normalizing makes just about any random function, as long as it connects the inputs to the outputs on some path, vibrate as some nonlinear shape of wave. This could be used as a game interface for evolvable musical instruments or fluid puzzle games. Physicsmata is similar in effect to SmoothLife but simpler and pure Java. The cellular automata API takes a function to run at each point. Its parameters are sums of screen brightness (n color dimensions are... -
8
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...
-
9
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. S-Match applies as a solution in many fields, including: information integration,... -
Catch Bugs Before Your Customers DoMove from alert to fix before users notice. AppSignal monitors errors, performance bottlenecks, host health, and uptime—all from one dashboard. Instant notifications on deployments, anomaly triggers for memory spikes or error surges, and seamless log management. Works out of the box with Rails, Django, Express, Phoenix, Next.js, and dozens more. Starts at $23/month with no hidden fees.
-
10
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... -
11
TreeLiker
TreeLiker is a collection of fast algorithms for working with complex
TreeLiker is a collection of fast algorithms for working with complex structured data in relational form. The data can, for example, describe large organic molecules such as proteins or groups of individuals such as social networks or predator-prey networks etc. The algorithms included in TreeLiker are unique in that, in principle, they are able to search given sets of relational patterns exhaustively, thus guaranteeing that if some good pattern capturing an important feature of the problem... -
12
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.
-
13
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
-
14
-
15
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.
-
16
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.
-
17
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/
-
18
Genetic Programming (tree structure) predictor within Weka data mining software for both continuous and classification problems.
-
19
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
-
20
A Java API for using suffix trees with natural language and an Eclipse/SWT-based GUI for suffix tree visualization using Graphviz.
-
21
A flexible Japanese to English language translation engine that allows multiple results be displayed according to all possible grammar ratings, i.e. a list of results will be displayed instead of only one. Please browse the CVS tree for actual project.
-
22
This project is an exercise and proof of concept. It aims to minimize the tree width of the tree decompositioned graph G with the methods of genetic algorithms.
-
23
Supertagger
Software for assigning supertags.
Supertagging is a process of statistical lexical disambiguation, preprocessing step to parsing, which assigns LTAG tree categories to the lexical items present in the input sentence. Thus, if the input sentence is in the form of a dependency tree, the task of the supertagger is to assign the most probable TAG family to each node and edge in the dependency tree. -
24
This project will design and build the Godwhale, a personal companion based on artificial intelligence, as described in the books "Half Past Human" and "The Godwhale" THIS PROJECT MOVED TO GOOGLECODE.COM WHERE THE CVS SUPPORT DOESN'T SUCK. LOOK FOR
-
25
GraphSpider is a pattern matcher which searches parsed text in phrase-structure tree or dependency graph format for syntactic structures matching a set of patterns in MPL, a regexp-like pattern language. Applications: information extraction, text mining.
- Previous
- You're on page 1
- Next
