Search Results for "all to"
Sort By:
Showing 33 open source projects for "all to"
View related business solutions-
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.
-
Nonprofit Budgeting SoftwareMartus' collaborative and easy-to-use budgeting and reporting platform will save you hundreds of hours each year. It's designed to make the entire budgeting process easier and create unlimited financial transparency.
-
1
Arduino
Open-source electronics platform
Arduino is an open-source physical computing platform based on a simple I/O board and a development environment that implements the Processing/Wiring language. Arduino can be used to develop stand-alone interactive objects or can be connected to software on your computer (e.g. Flash, Processing and MaxMSP). The boards can be assembled by hand or purchased preassembled. Arduino is a popular tool for IoT product development as well as one of the most successful tools for STEM/STEAM education.... -
2
TA-Lib.git: Technical Analysis Library
Mirror of the TA-Lib project using a Git repository
...It is intended for system integrators wishing to use TA-Lib in their Git-managed project through Git submodules or subtrees. No actual development is being done here; all development happens in the original project. -
3
jsprit
Open source toolkit for solving rich vehicle routing problems
jsprit is a java based, open-source toolkit for solving rich Traveling Salesman Problems(TSP) and Vehicle Routing Problems(VRP). It is lightweight, flexible and easy-to-use, and based on a single all-purpose meta-heuristic. Setting up the problem, defining additional constraints, modifying the algorithms and visualizing the discovered solutions is as easy and handy as reading classical VRP instances to benchmark your algorithm. It is fit for change and extension due to its modular design and a comprehensive set of unit and integration tests. ... -
4
Java Sorting
A program to benchmark 5 different sorting algorithms.
This program benchmarks the following sorting algorithms implemented in Java: Quick Sort, Heap Sort, Merge Sort, Selection Sort, and Bubble Sort. A command line GUI was created to facilitate all your benchmark needs. -
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.
-
5
-
6
Tetris Puzzle Solver
Fills a rectangle using given tetris shapes
Fills a rectangle using given tetris shapes (tetraminos) using an optimized brute force algorithm. A puzzle can have many different solutions; this solver will stop at the first one. Not all puzzles are solveable. Created to solve the annoying tetris puzzles in The Talos Principle and Sigils of Elohim. -
7
JaQLib is a compact Java library that supports programmers in querying all sorts of collections, DBs and XML files in a compact and intuitive manner. Example: List<MyItem> result = Jaqlib.List.selectFrom(myCollection) .where(myCondition).asList()
-
8
in here will be all codes of my games made in simple j and you can use it freely just put my name on the credits
-
9
JBernstein
JBernstein: Exploration techniques for non-linear constraint checking
...Concerning performance, the tool enables to check all examples in the PVS Bernstein testsuite within a second, which can be an order of magnitude faster than some other tools such as QEPCAD or REDLOG. Although JBernstein uses double, it offers automatic error-estimation capabilities (experimental) so that the generated result is correct (the solver may return unknown when the error-estimate is too large) -
All-in-one security tool helps you prevent ransomware and breaches.Blumira’s detection and response platform enables faster resolution of threats to help you stop ransomware attacks and prevent data breaches. We surface real threats, providing meaningful findings so you know what to prioritize. With our 3-step rapid response, you can automatically block known threats, use our playbooks for easy remediation, or contact our security team for additional guidance. Our responsive security team helps with onboarding, triage and ongoing consultations to continuously help your organization improve your security coverage.
-
10
ontocomp
OntoComP is a Protégé 4 plug-in for completing OWL ontologies
...If the user rejects it, the user has to give a counterexample to this question, i.e., an individual that is an instance of C1, C2 and not C3. When all such questions (about some initially given classes) have been answered, the ontology is complete with respect to the application domain. -
11
AlgART Java Libraries
Open source library for processing arrays and matrices
...Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over matrices, etc. - please see at the site. Almost all classes and methods are thoroughly documented via JavaDoc (you may read full JavaDoc at the site). -
12
Funnel Sort
command line sort utility
...It efficiently handles fixed length records and variable length records. Funnel easily handles ascii (readable) data and binary data. There are many more features in Funnel. It is easy to use and very fast. All documentation is on the Wiki. -
13
Java generic Iterator implementation to generate permutations and combinations. Uses the algorithm described here http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm#Even.27s_speedup and the clear description of that algorithm here: http://www.cut-the-knot.org/Curriculum/Combinatorics/JohnsonTrotter.shtml
-
14
Mouse Run
Programming Game, A Practice Tool for Building Intelligent Things
...It is a battle among programmers to test who can build the most intelligent mouse, given limited information during the game. Programmers need only implement one code file, extending from an abstract class that will contain the logic of the individual mouse. The game Host will gather all the mouse implementation and let them run in the maze. It is real fun for geeks/nerds/(or whatever you like to call yourself) like us. This game will be a perfect practice tool for programmers like us to find the best algorithm solutions and make the mouse intelligent. To get information on this game, visit the Mouse Run website at http://mouse-run.appspot.com If you have found bugs or have a request, please do write it in the reviews. ... -
15
BinBase
BinBase is a software for the automatic analysis of Massspec data from
BinBase is a software for the automatic analysis of Massspec data from LECO GC-Tofs. All code and documentation has been moved to the google code site of this project: https://code.google.com/p/binbase/ And support is provided by the company coding and more, which can be reached under: contact@codingandmore.org -
16
Java Random Numbers - Random.Org API
Offers Random numbers API for your programs written in Java.
...It provides algorithm to generate unspecified number of random numbers of certain total value. This algorithm still keeps server load low by sending as large requests as possible, yet all integers are truly random. ******************************************* Current version 1.5 is considered as STABLE version. All methods and whole class are documented via Javadoc. Credit goes to http://www.random.org -
17
EvolutionaryComputation
Evolutionary Computation on Android
...We, Tom BERNARD and Ugo PICHE, were asked to do this project as part of our electronic & computer science in the Polytech'Paris-UPMC engineer school, in France. We wanted to thank Mario Zechner and all contributors behind the fabulous libGDX project (https://code.google.com/p/libgdx/) which allowed us to use Box2D and OpenGL ES more, more easily than without this API. -
18
BayesianCortex
simple algorithm for a realtime interactive visual cortex for painting
...There will also be an API for using it with other programs as a general high-dimensional space. Each pixel's brightness is its own dimension. Bayesian nodes have exactly 3 childs because that is all thats needed to do NAND in a fuzzy way as Bayes' Rule which is NAND at certain extremes. NAND can be used to create any logical system. In this early version, I'm still working on edge detection and its understanding of the same shapes at different brightnesses. This will be a module of the bigger Human AI Net project and will be used for adding realtime intuitive high dimensional intelligence in audio and visual interactions with the user. -
19
A high-performance functional, set-theoretic collections library. All collections are immutable; updates return a new collection. Supports arbitrary nesting (sets of sets etc.). Implemented with heterogeneous binary trees. Lisp and Java; more to come.
-
20
A self-contained, fully configurable Java "game" to simulate multi-species evolution. Design species by optionally specifying every attribute; modify any or all environmental settings; let them loose to eat, fight, procreate, die, and Evolve!
-
21
The Idealize Recommendation Framework supports the development of recommender systems. We have devised a set of requirements all recommender systems must address, an architecture for those requirements, a technical vocabulary and a production model.
-
22
JavaStates is a Java library designed to statically describe and animate the states of Java objects, while ensuring that the integrity of states is retained at all times. JavaStates brings OO Programming style to interface spec, design and coding.
-
23
All pairs shortest path implementation using iterative mapreduce paradigm. Specifically, the iterative paradigm is an implementation of Twister (www.iterativemapreduce.org), developed by Indiana University.
-
24
Currently, all existing formal tools are designed to serve as formal verifiers, using one implementation or another. JTLV is a new tool aimed to facilitate and provide a unified framework to the development of formal verification algorithms.
-
25
The project contains algorithms for locating the most central groups in complex networks. In particular implementations of various centrality measures and heuristic search algorithms. All functionality is exposed via XML-RPC for easier exploitation.
