Full access to Enterprise features. No credit card required.
What if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
Try ServoDesk for free
Total Network Visibility for Network Engineers and IT Managers
Network monitoring and troubleshooting is hard. TotalView makes it easy.
This means every device on your network, and every interface on every device is automatically analyzed for performance, errors, QoS, and configuration.
A novel and effictive GA algorithm to solve optimization problem
Classical genetic algorithm suffers heavy pressure of fitness evaluation for time-consuming optimization problems. To address this problem, we present an efficient genetic algorithm by the combination with clustering methods. The high efficiency of the proposed method results from the fitness estimation and the schema discovery of partial individuals in current population and.
Specifically, the clustering method used in this paper is affinity propagation. The numerical experiments...
SMART (Shape Matching Algorithm Research Tool) enables you to implement 2D and 3D shape matching algorithms as plugins. Plugins can either be implemented in Java or as native plugins, i.e. in C/C++.
Testbed for playing with the algorithm "pagerank" of Google
Provide a testbed to play with pagerank-like algorithm on graph. You can easily add vertices, edges, save the graph for reuse, etc. For now, only Pagerank is implemented, but in the future, other algorithms will be added.
The Future of Pet Business Software for Modern Pet Care
Operate smarter, grow faster, scale effortlessly
MoeGo is the ultimate partner for your pawsome business to thrive. Use MoeGo for stressless operation, extrodinary customer experience and business growth. Scheduling with MoeGo is a true pleasure. Find the best time slot to book your clients with MoeGo Smart Schedule™. And specially for mobile groomers, optimize your driving route with MoeGo Route™. Set up your online storefront to present your brand, and schedule appointments in seconds. Or extend the capability of your own website with embedding. We collaborate with the best payment infrastructure provider in the industry to ensure fast and secure transactions. Choose any payment method at your convenience, no matter online or in person. Connect with customers outside of your salons and vans. Keep up with your customers’ expectation. Turn every customer into a recurring with industry leading pet parent experience.
A library help for signing data with PKCS11 token (certificates with SHA1withRSA Sign Algorithm) and create CMS packages.
It uses Bouncy Castle Crypto API and SUNPKCS11.
Also it verify the signed data and verify signing certificate's OCSP control.
OpenForecast is a package of general purpose, forecasting models written in Java that can be applied to any data series. No knowledge of forecasting is required. Using this package, the most appropriate algorithm for your data will be selected.
GeneThello (read jə-ˈne-ˈthe-lō), is an acronym for genetic othello, an othello (reversi) playing program which based on Genetic Algorithm (GA). In principle GeneThello consist of an othello program and a genetic algorithm system.
ProViz is a program visualization framework for Java. It is built as a plugin to the Eclipse IDE. (We are getting close to publishing resources and making this project distributable. Stay tuned!) A video demo: http://www.youtube.com/watch?v=BsoK1n-OM
X-GAT (XML-based Genetic Algorithm Toolkit) is a Java framework to optimize problems with Genetic Algorithms (GAs). Differently from other frameworks, X-GAT contains ready-to-use GAs implementations and new features can be easily added.
A java project to create a library that can calculate decompression schemes for diving. Different open source algorithms can be chosen to use for the calculation. For example Bühlmann and VPM.
The BalanceLine4j Project is an implementation of the Balance Line Algorithm for Java applications. The Balance Line is an algorithm used to make Coordinated Processing and Sequential Updates, that improves performance and saves machine resources.
RES is a pure Java based Open Source Cobol to Javatranslator. It creates maintainable Java code for a subset of VS Cobol syntax. It has been developed with JDK, JTB and Javacc.
XUL4Java is a XML UI Framework built upon Java, that lets you build feature rich, cross platform applications across Hetrogenous Architecture, building rich client, desktop , web and mobile application. 'Created For Once And For Ever '
Beagle is Java open source framework for running and managing nondeterministic algorithms such as genetic algorithms for solving complex problems. Beagle is fully modular and maintains whole history of algorithm progress for further analysis.
LEA is a lightweight eyetracking algorithm library (hence the name) written in and for Java. LEA is able to track eye movements with an ordinary webcam and returns relative movements (up, down, ...). It is also able to compensate for slight head motions.
ooc is an object-oriented programming language which is implemented with a source-to-source translator to pure C99. It supports classes, abstract functions, foreach, ranges, etc. It intends to be modern, modular, extensible, yet simple and fast.
Jbi4Corba is a JBI binding component for the corba protocol. Basically it is a protocol translator from the CORBA protocol to the JBI normalized message protocol. Once a corba service is published as a JBI endpoint it can participate the ESB processes.
Resource Bundle Manager is a web application that manages Java resource bundles. It can import property files, export property files in UTF-8 format and edit key value pairs in a spreadsheet-like entry screen.
G.A.V. (Graph Algorithm Visualizer) is a tool that visualizes algorithms from graph theory. A step-by-step visualization from each different algorithm allows the user to understand the particular algorithm very easily.
The goal: to provide implementations of as many algorithms (sorting, searching, ...) and data structures (lists, trees, ...) as possible, accompanied by discussion of big O run time and memory limits and references to sources of further study.