Open Source Java Algorithms for Mac
Sort By:
Java Algorithms for Mac
View 1429 business solutionsBrowse free open source Java Algorithms for Mac and projects below. Use the toggles on the left to filter open source Java Algorithms for Mac by OS, license, language, programming language, and project status.
-
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.
-
Deliver secure remote access with OpenVPN.OpenVPN's products provide scalable, secure remote access — giving complete freedom to your employees to work outside the office while securely accessing SaaS, the internet, and company resources.
-
1
Structorizer is a little tool which you can use to create Nassi-Schneiderman Diagrams (NSD). Stuctorizer is written in Java and free for any use. The code has been moved to Github: https://github.com/fesch/Structorizer.Desktop
-
2
PortugolViana é uma ferramenta open-source para edição/execução algorítmica. PortugolViana permite a edição de algoritmos em português (do Brasil e de Portugal) e a sua execução e monitorização.
-
3
BigAl
a free cross platform calculator for calculating BIG numbers
BigAl is a free open source and platform independent software for calculating really BIG numbers. It supports not only standard arithmetic, but also exact period determination, predefined factorials, fibonacci with seeds, factorization, nth root, etc -
4
Blubber system is an Eclipse RCP application for distributed systems modeling. Designed for university researches and inlcudes: task graph editor; graph transformation tools; graph modelling on distributed system; real-time modelling on GerdaFramework.
-
Photo and Video Editing APIs and SDKsUnlock Picsart's full editing suite by embedding our Editor SDK directly into your platform. Offer your users the power of a full design suite without leaving your site.
-
5
-
6
EasyCSP
Constraint Satisfaction Problem solving library for Java
EasyCSP is an open-source Java library for Constraint Satisfaction Programming. EasyCSP offers search algorithms for both CSPs and CSOPs. EasyCSP supports CSPs to be formalized using objects or int expressions. EasyCSP on GitHub: http://github.com/cordisvictor/easycsp-lib -
7
Classroom allocation using Genetic Algorithms and restricted mutation. Developed by AIGroup: Pablo Cababie, Facundo Cancelo, Alvaro Zweig y Gabriel Barrera
-
8
Hipo is a hypothetical computer to facilitate the learning of machine language. The student can use hipo to develop simple programs and understand the internal logic of a computer. There is a plan to implement Donald Knuth's MMIX machine language, also.
-
9
Das Horner-Schema ist ein schnelles und einfaches Verfahren, um einen Funktionswert von Polynomen an einem gegeben Wert zu berechnen. Dieses Projekt beinhält eine Facharbeit und Programmierbeispiele in Pascal und Java zum Thema.
-
No-Nonsense Code-to-Cloud Security for Devs | AikidoAikido provides a unified security platform for developers, combining 12 powerful scans like SAST, DAST, and CSPM. AI-driven AutoFix and AutoTriage streamline vulnerability management, while runtime protection blocks attacks.
-
10
Institute of Technology, Blanchardstown Computer Science code by the class of 2007-2011 on course BN104. In this project we are open sourcing all of our project work to the public in the hopes it can be reused, built-upon, and used in education.
-
11
Java generic API for search algorithms on graphs implicitly given by tree node expansion operator
-
12
JMill is the java-based game of "Nine Men's Morris". This project is son of the greater parent SourceForge project "JGames", that realizes the real game environment...
-
13
JOthi is the java-based game of "Othello". This project is son of the greater parent SourceForge project "JGames", that realizes the real game environment: JOthi only defines the "Othello" game rules and its specific AI players.
-
14
Java Combinatorial Optimization Platform is used to solve combinatorial problems using common interface, providing means to easily add new algorithms and problems and to benchmark them.
-
15
-
16
An enhanced Simulator based on Agent Grid Repast.It has some bugs cleared from Agent Grid Repast and has enhanced features on Group Selection Policy.
-
17
Levenshtein distance Java Libarary
Java library implementing Levensh distnce
-
18
Math4J is a java library with an object-oriented design of some mathematical ideas: functions, primality, complex numbers, etc. It also consists of some utility methods and classes for mathematical constructions.
-
19
MobileMath is a software written by using J2ME technolology. It turns mobile into calculator supporting many operations such as : evaluate expression, plotting, differentiate & integrate expression... It can run on any mobiles supporting Java.
-
20
A simulation environment for 2D robots to interact and perform tasks in. Meant to be educational and demonstrate emergent behaviors. No download necessary! See demos on project website!
-
21
PetriOpti
Petri network optimization with Martinez-Silva algorithm
A simply application in order to demonstrate Martinez-Silva optimization algorithm on Petri networks. -
22
Robotypo
Robotypo Web app hosts battles between robots - simple Java programs.
Robotypo is a Web app which hosts battles between robots - simple Java programs. This project is the Eclipse project archive of RobotypoCreator, which is for creating robots on Robotypo: http://robotypo.appspot.com -
23
RunAsApproximator es un programa java multilenguaje que implementa algoritmos numéricos. Los datos de entrada son aquellos requeridos por cada algoritmo y los de salida son resultado final y los datos intermedios necesarios para alcanzar su resolución.
-
24
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, ontology evolution and alignment, peer-to-peer information sharing, digital libraries integration, web service composition, agent communication, and query answering on the web. S-Match is extendable to host new algorithms. -
25
Currently, all existing formal tools are designed to serve as formal verifiers, using one implementation or another. NO tool is providing a global framework to develop algorithms. Silicis is a new formal framework for designing [verification] algorithms.
