Browse 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.

  • Level Up Your Cyber Defense with External Threat Management Icon
    Level Up Your Cyber Defense with External Threat Management

    See every risk before it hits. From exposed data to dark web chatter. All in one unified view.

    Move beyond alerts. Gain full visibility, context, and control over your external attack surface to stay ahead of every threat.
    Try for Free
  • Gen AI apps are built with MongoDB Atlas Icon
    Gen AI apps are built with MongoDB Atlas

    The database for AI-powered applications.

    MongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
    Start Free
  • 1
    Simple genetic programming framework. Features a robust set of interfaces and standard implementations for rapid development and ease of experimentation.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    jPasswordWallet strores your passwords in security. Find, modify or create quickly a password in the database. Organize your passwords as you like with creating categories and sub categories.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    jStates is a java library for easy state machine design and implementation.It uses XML to define states and state transitions. jStates is aimed at easy integration with desktop J2SE applications, Struts, Commons Validator, Web and other J2EE technologies
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    java-string-similarity

    java-string-similarity

    Implementation of various string similarity and distance algorithms

    Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity. A library implementing different string similarity and distance measures. A dozen of algorithms (including Levenshtein edit distance and sibblings, Jaro-Winkler, Longest Common Subsequence, cosine similarity etc.) are currently implemented. The main characteristics of each implemented algorithm are presented below. The "cost" column gives an estimation of the computational cost to compute the similarity between two strings of length m and n respectively. If the alphabet is finite, it is possible to use the method of four russians (Arlazarov et al. "On economic construction of the transitive closure of a directed graph", 1970) to speedup computation. This was published by Masek in 1980 ("A Faster Algorithm Computing String Edit Distances").
    Downloads: 0 This Week
    Last Update:
    See Project
  • Build Securely on Azure with Proven Frameworks Icon
    Build Securely on Azure with Proven Frameworks

    Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.

    Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
    Download Now
  • 5
    This project is a reasoner for the description logic EL+. It computes the concept subsumption hierarchy. It is an OWL 2 EL reasoner.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6
    Java library for operations with Iterables and other data structures in functional way.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    jmathstudio - Java Image/Signal toolkit

    jmathstudio - Java Image/Signal toolkit

    Java toolkit for discrete Image and Signal processing.

    JMathStudio is a Java based digital image and signal processing toolkit/library. It is simple to use, portable, light (~300 Kb), extendable and free. Full source code available at https://github.com/bhavyaajani/jmathstudio Android compatible JMathStudio is available @ https://sourceforge.net/projects/jmathstudio-android/
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8
    jpaul is a Java implementation of several algorithms widely used in program analysis. It emphasizes flexibility and ease-of-use and is independent of any specific compiler infrastructure project. BSD Licence.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 9
    jr239co620
    Downloads: 0 This Week
    Last Update:
    See Project
  • Simple, Secure Domain Registration Icon
    Simple, Secure Domain Registration

    Get your domain at wholesale price. Cloudflare offers simple, secure registration with no markups, plus free DNS, CDN, and SSL integration.

    Register or renew your domain and pay only what we pay. No markups, hidden fees, or surprise add-ons. Choose from over 400 TLDs (.com, .ai, .dev). Every domain is integrated with Cloudflare's industry-leading DNS, CDN, and free SSL to make your site faster and more secure. Simple, secure, at-cost domain registration.
    Sign up for free
  • 10

    kovacs.util (Java numerical classes)

    !!! moved to jnum subproject under crush-software !!!

    This project has be renamed to jnum and moved under the crush-software project. No further SVN commits here...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 11

    ktree

    clustering, machine learning, algorithms

    This project has moved to github at http://lmwtree.devries.ninja.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 12
    LDIFF is an enhanced language-independent line differencing tool built upon the Unix diff and overcomes its limitations in determining whether an artifact line has been changed or is the result of additions and removals
    Downloads: 0 This Week
    Last Update:
    See Project
  • 13
    leetcode-editor

    leetcode-editor

    Do Leetcode exercises in IDE

    Do Leetcode exercises in IDE, support leetcode.com and leetcode-cn.com, to meet the basic needs of doing exercises.Support theoretically: IntelliJ IDEA PhpStorm WebStorm PyCharm RubyMine AppCode CLion GoLand DataGrip Rider MPS Android Studio. The login accounts of the two websites are not interoperable and the corresponding users need to be configured when switching websites. You can also refresh and load questions if you are not logged in, but you cannot submit it. Input the content and press Enter to search , press again to search for the next one. It can only search under the question bank node. Clean up the files in the configured cache directories. The cache directories of the two websites are different and only the current configured websites are cleaned up. Carefully clean up cases without submitting.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 14
    Locality Sensitive Hashing is an improved indexing method for high dimensional data. lshtools provides indexing with LSH and an intelligent non supervised subsampling strategy using this indexing method.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 15
    neochip is a collection of algorithms for high-density oligonucleotide microarrays. The current version contains heuristic algorithms that attempt to improve the quality of arrays by re-designing their layout (the location of the probes on the chip).
    Downloads: 0 This Week
    Last Update:
    See Project
  • 16

    ontocomp

    OntoComP is a Protégé 4 plug-in for completing OWL ontologies

    OntoComP is a Protégé 4 plug-in for completing OWL ontologies. It enables the user to check whether an OWL ontology contains "all relevant information" about the application domain, and extends the ontology appropriately if this is not the case. It achieves this by asking the user questions of the form "are instances of classes C1 and C2 also instances of class C3?". If the user confirms such a question, then a new axiom of the application domain that does not follow from the ontology has been discovered, and it is added to the ontology. 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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 17
    A library to support spread activation techniques over ontologies.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 18
    op4j is a developer happiness tool. Its aim is to reduce the amount of similar lines of code needed to do every day tasks in our code by providing an operator chaining tool to perform easy iterations on lists, OGNL evaluation, data type conversion...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 19
    Openminer, as a data mining engine, is developed on java for analysis of dataset with the methods of data mining. By making use of openminer, we could discovery the knowledge which interests us but hides in the raw data.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 20
    Our Project is a little program that implements dijktra- and kruskalalgorithms.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 21
    >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> pack:tag is now available at github: https://github.com/galan/packtag >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    Downloads: 0 This Week
    Last Update:
    See Project
  • 22
    Semantic query optimization (SQO) is the process of finding equivalent rewritings of an input query given constraints that hold in a database instance. We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity in practical situations significantly.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 23
    Framework: Project for Evolutionary Predator Prey Algorithms, used to implement an evolutionary scheme based on the developement by van Laumanns. Implement testproblems, special behaviours, environments, and other yet not known features.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 24
    phonet4j is the port of a extensible, rule based algortihm for phonetic conversions written by Joerg Michael to java. His code was first published in the computer magazine c't (issue 25/1999, pp. 252). Includes two rulesets for the german language.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 25
    PileWorks provides the organizational structure for coordinating several different projects which approach some aspect of Pile Technology. PileWorks defines a set of interfaces and implements some basic infrastructure for Pile engines and agents.
    Downloads: 0 This Week
    Last Update:
    See Project
Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.