Search Results for "problem a"

x
Sort By:

Showing 4 open source projects for "problem a"

View related business solutions
Artificial Intelligence C Clear Filters & Widen Search
  • Ship Agents Faster Icon
    Ship Agents Faster

    Transform your applications and workflows into powerful agentic systems at global scale.

    Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
    Start Free
  • $300 Free Credits to Build on Google Cloud Icon
    $300 Free Credits to Build on Google Cloud

    New customers can spin up VMs, build with AI, and query data at no cost.

    Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
    Start Free
  • 1
    The Operator Splitting QP Solver

    The Operator Splitting QP Solver

    The Operator Splitting QP Solver

    OSQP uses a specialized ADMM-based first-order method with custom sparse linear algebra routines that exploit structure in problem data. The algorithm is absolutely division-free after the setup and it requires no assumptions on problem data (the problem only needs to be convex). It just works. OSQP has an easy interface to generate customized embeddable C code with no memory manager required. OSQP supports many interfaces including C/C++, Fortran, Matlab, Python, R, Julia, Rust.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    This project aims to create an application to solve the job shop schedule problem using genetic algorithm on the IBM Cell BE processor. This is useful especially using the power of Cell for the large scale job shop schedule problem.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    This project provides some hyperheuristics, implemented as C libraries. A hyperheuristic can be used to handle any optimization problem, as long as you implement some simple specific code to interact with it. Some examples/applications are also provided.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    Exploration in Evolutionary Computing, implementing the Traveling Salesman Problem, solving it by creating random solutions and apply random solutions to the survivors of an evaluation/elimination process.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Veeam Data Platform v13.1 Icon
    Veeam Data Platform v13.1

    Move workloads across hypervisors and clouds with no vendor lock-in. Try VDP free today.

    Try Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
    Try Now
  • Previous
  • You're on page 1
  • Next

Related Searches

Related Categories

auth0 logo