Search Results for "tree"
Sort By:
Showing 26 open source projects for "tree"
View related business solutions-
Retool your internal operationsBuild internal software that meets enterprise security standards without waiting on engineering resources. Retool connects to your databases, APIs, and data sources while maintaining the permissions and controls you need. Create custom dashboards, admin tools, and workflows from natural language prompts—all deployed in your cloud with security baked in. Stop duct-taping operations together, start building in Retool.
-
Outgrown Windows Task Scheduler?Windows Task Scheduler wasn't built for complex, cross-platform automation. Get a free diagnostic that shows exactly where things are failing and provides remediation recommendations. Interactive HTML report delivered in minutes.
-
1
GIT quick statistics
An efficient way to access various statistics in git repository
...You can change to the legacy color scheme by toggling the variable _MENU_THEME between default and legacy. You can set variable _GIT_LIMIT for limited output. It will affect the "changelogs" and "branch tree" options. You can also exclude files from the stats. Note that it works with any alphanumeric, glob, or regex that git respects. -
2
CART
Reversible cellular automata
Reversible and irreversible cellular automata simulator for Windows and Linux. May use MCell *.dll and Golly https://sourceforge.net/projects/golly *.tree and *.rle files. Adapted for work with generalizations of reversible second-order cellular automata discussed in http://arxiv.org/abs/1311.4297 -
3
MLPACK is a C++ machine learning library with emphasis on scalability, speed, and ease-of-use. Its aim is to make machine learning possible for novice users by means of a simple, consistent API, while simultaneously exploiting C++ language features to provide maximum performance and flexibility for expert users. * More info + downloads: https://mlpack.org * Git repo: https://github.com/mlpack/mlpack
-
4
A package for computations with finite automata (rooted tree automorphisms) for the GAP system, http://www.gap-system.org.
-
Atera all-in-one platform IT management software with AI agentsAtera’s AI agents don’t just assist, they act. From detection to resolution, they handle incidents and requests instantly, taking your IT management from automated to autonomous.
-
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
VeriSiMPL
Verification via biSimulations of Max-Plus-Linear models
...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. ... -
7
Primes
Calculate primes by using extremely fast sorting
...And as already mentioned, it's just the most efficient tree-based sorting algorithm that you can get. But furthermore this way of finding primes interestingly leaves a hard nut to crack for mathematicians: In very rare cases it finds numbers that are not primes. For all primes below one million this phenomenon arises in exactly two cases: 31213 which is 7 * 7 * 7 * 7 * 13 336141 which is 3 * 3 * 13 * 13 * 13 * 17 Who can explain, why? -
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
Peklo is a graph editor and an environment for visualizing and comparing different algorithms for some graph-theoretic problems, e.g. flows, shortest path, minimum spanning tree.
-
Free and Open Source HR SoftwareGive your HR team the tools they need to streamline administrative tasks, support employees, and make informed decisions with the OrangeHRM free and open source HR software.
-
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
Stackless Iterative Tree Traversal in C
A small program that traverses a tree iteratively without a stack.
A small program that traverses a tree iteratively without a stack. -
12
-
13
Set Theory Relations in Java
Java classes implementing set theory relation concepts
...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. -
14
-
15
The TreeRank project is a R package implementing a Machine Learning algorithm to build tree-based ranking rules from data with binary labels, based on ROC optimization.
-
16
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.
-
17
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
-
18
Math-fi library written in C++ and boost library. This contains a C++ library with severals financial models (Monte carlo, Binary Tree, Black and Schools formulas) and a managed C++ wrapper that allows end user to use library within Excel.
-
19
A set of small utilities realizing theoretical graph algorithms (including tree algorithms). The utilities work with simple text input/output formats.
-
20
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.
-
21
The algorithm allows any kind of weights (costs, frequencies), including non-numerical ones. The {0, 1, ..., n-1} alphabet is used to encode message. Built tree is n-ary one.The algorithm is based on a set of template classes : Cell(SYMBOL, WEIGHT), Node(
-
22
Numerically estimate an efficiency of code construction algorithms. Randomly generate n binary words of length m with minimum Hamming distance d and create a prefix code (= retrieval tree) from them. Based on PhD work.
-
23
Latex editor with document structure tree view and project handling. Latex output allows direct jump to warnings/errors. Projects folders gives support for figures/graphs. Editor component includes usual features like search/replace and syntax highlight.
-
24
libQuest is a quest management library. In libQuest, a quest is defined as an event or a combination of other quests such that high level statements can be easily represented in a quest tree. libQuest is being designed with respect to Quest/Mission based
-
25
