Search Results for "java implementation loader" - Page 4
Sort By:
Showing 102 open source projects for "java implementation loader"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
MongoDB 8.0 on Atlas | Run anywhereMongoDB 8.0 brings enhanced performance and flexibility to Atlas—with expanded availability across 125+ regions globally. Build modern apps anywhere your users are, with the power of a modern database behind you.
-
1
RL Poker is a study project Java implementation of an e-soft on-policy Monte Carlo Texas Hold'em poker reinforcement learning algoritm with a feedforward neural network and backpropagation. It provides a graphical interface to monitor game rounds.
-
2
Random Forest classification implementation in Java based on Breiman's algorithm (2001). It assumes the data is in the form [ X_1, X_2, . . ., X_M, Y ] where Y \in {0, 1, . . ., C}. The user must define M, C, and m initially.
-
3
Wodka is the implementation of a genetic algorithm (GA) that can bread two dimensional structures that might be used as robots in sodarace competitions.
-
4
Java implementation of Sudoku. Visually attractive, interactive version with intelligent and brute force solving strategies.
-
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
5
KNN-WEKA provides a implementation of the K-nearest neighbour algorithm for Weka. Weka is a collection of machine learning algorithms for data mining tasks. For more information on Weka, see http://www.cs.waikato.ac.nz/ml/weka/.
-
6
DrPangloss is a python implementation of a three operator genetic algorithm, complete with a java swing GUI for running the GA and visualising performance, generation by generation
-
7
An implementation of the Compositional Pattern Producing Networks (CPPNs) and Neuro-Evolution of Augmenting Topologies (NEAT) proposed by Kenneth O. Stanley, based on the Genetic Art tool from Mattias Fagerlund.
-
8
A Java implementation of the NEAT algorithm as created by Kenneth O Stanley. Also provides a toolkit for further experiments to be created and can provide both local and distributed learning environments.
-
9
JavaSOM package is an implementation of self-organizing maps (SOM), based on neural networks, to Java2 programming language and utilization of XML based application languages for information exchange and visualization.
-
No-Nonsense Code-to-Cloud Security for Devs | AikidoAikido provides a unified security platform for developers, combining 12 powerful scans like SAST, DAST, and CSPM. AI-driven AutoFix and AutoTriage streamline vulnerability management, while runtime protection blocks attacks.
-
10
Message Transport Protocol (MTP) implementation using XMPP for the Java Agent DEvelopment framework (JADE). Produced under the Google Summer of Code program with the help of Quantum Leap Interactive and Jabber, Inc.
-
11
ANJI (Another NEAT Java Implementation) Built on top of existing OpenSource projects, ANJI is an implementation of NEAT (Neuro-Evolution of Augmenting Topologies), an algorithm for evolving artificial neural networks.
-
12
-
13
An ANN design/implementation focused to work with optimally with NEAT (http://www.cs.utexas.edu/users/kstanley/neat.html). Semiann uses a sparse matrix to fill out the nodes, connections, weights, biases and activation functions for an ANN.
-
14
CLearJ is a clean Java-implementation of Common Lisp. The big goals are ANSI standard compliance, interoperability with Java and integration with scripting environments. This project is meant to be a sibling to CLearSharp, with sharing of implementation.
-
15
JPlan is a java implementation of GraphPlan, a fast domain independent planner. JPlan allows developers and researchers to use and experiment with this planner, build variants of GraphPlan, and add a planning capability to their new projects.
-
16
-
17
Gazoo is a Java framework for genetic algorithms development. Gazoo provides the core of a genetic algorithm, leaving to the user the implementation of specific-problem classes.
-
18
KEA - agent micro-platform and Procedural Reasoning System. Java-based implementation of an agent platform with a flexible PRS-like system. The main attributes of the architecture are: agents, goals and roles. KEA platform is goal-driven.
-
19
The Pattern Recognition Analysis Project is a Java implementation of a basic multilayered backpropagation neural network, used in a color recognition and character recognition project, made for educational and experimental purposes.
-
20
Contextual rule-based text normalization engine written in java, that can be used to implement stemming algorithms or phonetic normalizers. The project includes a french stemmer/phonetic normalizer, and a soundex implementation. Includes a Lucene Analyzer
-
21
This is one approach to implementing the ideas discussed as the Public Domain Knowledge Base. Originally coded by Stephen Reed before joining Cycorp and currently maintained by Vic Bancroft. The next release with contributions made here will be versio
-
22
This project is for automatically rotating images based on content. This was a masters project and contains simple implementations of machine learning algorithms.
-
23
Neural Network with Backpropagation learning technique. Software model for hardware implementation (FPGA) .
-
24
JCheckers is a basic implementation of the checkers game using the framework from JGameAI. It is a public universitary project and will grow in future. Based on the framework JGameAI we want also improve new strategies on artificial intelligence.
-
25
A straight-forward Java implementation of a mixture model with pluggable mixture functions, e.g. a mixture of Gaussian functions. The number and dimensionality of the mixture functions is not limited. All critical calculations are performed in log-space.
