Showing 3 open source projects for "problem a"

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
  • $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
    blavaan

    blavaan

    An R package for Bayesian structural equation modeling

    ...The development version of blavaan (containing updates not yet on CRAN) can be installed via the command provided in the documentation. Compilation is required; this may be a problem for users who currently rely on a binary version of blavaan from CRAN. The blavaan package depends on the lavaan package for model specification and for some computations. This means that, if you already know lavaan, then you should already be able to do many things in blavaan. In particular, many blavaan commands add the letter “b” to the start of the lavaan command. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    Digraph3

    Digraph3

    A collection of python3 modules for Algorithmic Decision Theory

    ...Technical documentation and tutorials are available under the following link: https://digraph3.readthedocs.io/en/latest/ The tutorials introduce the main objects like digraphs, outranking digraphs and performance tableaux. There is also a tutorial provided on undirected graphs. Some tutorials are problem oriented and show how to compute the winner of an election, how to build a best choice recommendation, or how to linearly rank or rate with multiple incommensurable performance criteria. Other tutorials concern more specifically operational aspects of computing maximal independent sets (MISs) and kernels in graphs and digraphs.
    Downloads: 11 This Week
    Last Update:
    See Project
  • 3
    National University Community Research Institute's NU KEEPERRHHATT Algorithmic Framework is a series of meta-algorithms based upon the Longest Hamiltonian Path Problem for finding high level explanations to social, economic and political behaviour.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next