3 projects for "mike" with 2 filters applied:

  • Build Agents and Models on One Platform Icon
    Build Agents and Models on One Platform

    Everything you need to build production-ready agents and models. Access 200+ Google and third-party AI models and tools.

    Gemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
    Try It 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

    NetRexx

    The open sourced NetRexx reference implementation

    ...It supports a classic REXX syntax, with no reserved keywords, along with considerable additions to support object-oriented programming in a manner compatible with Java's object model, yet can be used as both a compiled and an interpreted language, with an option of using only data types native to the JVM or the NetRexx runtime package. Originally from IBM, NetRexx is the creation of Mike Cowlishaw, the 'Father of Rexx'. This IBM product has been open sourced in 2011.
    Downloads: 3 This Week
    Last Update:
    See Project
  • 2
    OO7J is a Java version of the original OO7 benchmark (written in C++) from Mike Carey, David DeWitt and Jeff Naughton = Univ Wisconsin-Madison.The original benchmark tested ODBMS performance. This project also includes benchmarking ORM Tools
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    Tuple Spaces

    Tuple Spaces

    Tuple space with time outs and transactions.

    Java implementation of a Tuplespace. Moved to https://github.com/mike-k-houghton/tuplespace A Tuple is an ordered list of items. A Tuple Space is a form of associative memory where entries, tuples, are stored in the space and are retrieved using search criteria that are based on the intrinsic properties of the tuples. The two key operations are put get And that is it! There are refinements on these operations including, for example, timeouts where the tuple will only exist for a given period and also transactions that are based on atomic actions and commit/rollback in the tuplespace.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next