Showing 7 open source projects for "permutations"

View related business solutions
  • Build Securely on AWS with Proven Frameworks Icon
    Build Securely on AWS 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
  • MongoDB Atlas runs apps anywhere Icon
    MongoDB Atlas runs apps anywhere

    Deploy in 115+ regions with the modern database for every enterprise.

    MongoDB 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.
    Start Free
  • 1
    Swift Algorithms

    Swift Algorithms

    Commonly used sequence and collection algorithms for Swift

    ...We hope this new package will help people embrace algorithms, improving the correctness and performance of their code. With the Algorithms package’s initial set of sequence and collection operations, you can cycle over a collection’s elements, find combinations and permutations, create a random sample, and more. One inclusion is a pair of chunked methods, each of which break a collection into consecutive subsequences. One version tests adjacent elements to find the breaking point between chunks, you can use it to quickly separate an array into ascending runs.
    Downloads: 6 This Week
    Last Update:
    See Project
  • 2

    Build & Lexigraphical Permutations

    Documentation of two types of permutation algorithms

    This project provides documentation on two different approaches to permutations. Permutations can be generated by building them or by transposing characters between different character positions. My project addresses the efficiency between CPU speed and memory usage for generating unique permutations from input source texts that have repeated characters. The challenge is to create an efficient algorithm that can have the capacity to permutate sources texts that are hundreds and thousands of characters long without running out of memory. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3

    JavaGimmicks

    Utility classes, APIs and tools for Java

    A set of helper and utility classes, APIs and tools for the Java Programming Language. For more details - pleas visit the project homepage.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    hopin

    hopin

    list all permutations of a list of given numbers

    PermutationCounter (VB.NET with ActiveX) - Lists all permutations of a list of given numbers.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Enterprise-grade ITSM, for every business Icon
    Enterprise-grade ITSM, for every business

    Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity.

    Freshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
    Try it Free
  • 5
    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
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6
    gacap is a C++ template library about `Generating All Combinations and Permutations'. It refers to std::next_permutation().
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    Path Partitioner

    Path Partitioner

    Finds bad examples for the local search Path Partitioning algorithm

    ...See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf. Requirements: Microsoft Automatic Graph Layout http://research.microsoft.com/en-us/projects/msagl/ Gurobi Optimizer http://www.gurobi.com/ Permutations, Combinations, and Variations using C# Generics http://www.codeproject.com/Articles/26050/Permutations-Combinations-and-Variations-using-C-G
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next
Auth0 Logo