Showing 2 open source projects for "radial basis function"

View related business solutions
  • 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
  • Custom VMs From 1 to 96 vCPUs With 99.95% Uptime Icon
    Custom VMs From 1 to 96 vCPUs With 99.95% Uptime

    General-purpose, compute-optimized, or GPU/TPU-accelerated. Built to your exact specs.

    Live migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
    Start Free
  • 1
    JSVerbalExpressions

    JSVerbalExpressions

    JavaScript Regular expressions made easy

    VerbalExpressions is a JavaScript library that helps to construct difficult regular expressions. Methods have a return type of VerbalExpression except where mentioned otherwise. If there is no mention of a method’s parameters, it is to be assumed that it has none. VerEx is the function that is exported from within VerbalExpressions.js and is to be the first method in chains that describe verbal expressions. Construct and return a new instance of VerbalExpression. Used to support the new...
    Downloads: 1 This Week
    Last Update:
    See Project
  • 2
    SPARGEL

    SPARGEL

    An opensource Java graph library. Abandoned, ignore.

    Spargel is a Java graph library that puts its effort in having a rather small but powerful code basis. This is achieved by extending graphs via properties in form of vertice and edge maps. Because these maps are an individual implementation depending on the graph datastructure used, they are more memory efficient than using a Java HashMap. Currently spargel is in its early stages, but will soon support more tasks. As now, implemented are: * Adjecency graph data structures * Algorithms: SSSP, APSP, Traversal, Min-Cut, Max-Flow, Many types of finding Components * Creating sub graphs, vertice and edge maps that use a function to implement their mapping. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next