Showing 4 open source projects for "backtracking"

View related business solutions
  • Full-stack observability with actually useful AI | Grafana Cloud Icon
    Full-stack observability with actually useful AI | Grafana Cloud

    Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.

    Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
    Create free account
  • Fully Managed MySQL, PostgreSQL, and SQL Server Icon
    Fully Managed MySQL, PostgreSQL, and SQL Server

    Automatic backups, patching, replication, and failover. Focus on your app, not your database.

    Cloud SQL handles your database ops end to end, so you can focus on your app.
    Try Free
  • 1
    Pytholog

    Pytholog

    A logic programming tool and a logical database with a RESTful API

    Pytholog Tool (Command line & API) An executable tool, built in python, that enables logic programming and prolog syntax through interactive shell that mimics prolog language and / or RESTful API that can be called from other applications. The tool is based on the python library pytholog which can be found here: https://github.com/mnoorfawi/pytholog The tool starts normally from the command line. Let's look at the arguments that can be specified while initiating the tool: $...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    Animal-AV

    Animal-AV

    Animal Algorithm Animation System

    ...Animations can be generated on the fly based on user input - for a large selection of algorithms and topic areas, including, but not limited to, the topic areas of backtracking algorithms, compression, cryptography, basing, searching and sorting.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3

    Approximate Subgraph Matching Algorithm

    Approximate Subgraph Matching Algorithm for Dependency Graphs

    The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach (http://esmalgorithm.sourceforge.net). We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively, the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m). ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4

    Exact Subgraph Matching Algorithm

    Exact Subgraph Matching Algorithm for Dependency Graphs

    The subgraph matching problem (subgraph isomorphism) is NP-complete. We designed a simple exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach. The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree. We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue association detection and Protein-Protein interaction identification. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Your monitoring isn't a stack. It's a pile. Fix that. Icon
    Your monitoring isn't a stack. It's a pile. Fix that.

    Errors, performance, logs, uptime. One install, one invoice, one UI.

    Replace Datadog, New Relic, and Sentry without adding three more dashboards.
    Free 30 days.
  • Previous
  • You're on page 1
  • Next