Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity.
Freshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
Try it Free
Try Google Cloud Risk-Free With $300 in Credit
No hidden charges. No surprise bills. Cancel anytime.
Use your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
The General Intensional Programming System (GIPSY) consists in three modular sub-systems: The General Intensional Programming Language Compiler (GIPC) ; the General Eduction Engine (GEE), and the Intensional Run-time Programming Environment (RIPE).
MEASJ, the Multiply Extensible Architecture Simulator in Java, is a Framework for creating Simulations and Emulations of von Neumann architecture based systems.
Kaph provides a portable (written in Java) method by which to display and guide users through multiple-subject research surveys. Configuration is handled via XML files. Support for a wide range of types of questions is provided.
The compilerMonitor persists a record of all javac error messages and the sources that caused/fixed the errors. It is a CAUSE (computer-aided usability engineering) tool that analyzes interaction between a developer and the compiler.
GraphScript project is a network theory simulator based purely on Java and Java scripting engines.
It is intended to allow fast development, testing and visualization of network theory (graph) algorithms.
java-turing-emulator aims to provide a GUI for creating, editing and simulating Turing machines and deterministic machines. its build in java and uses the swt-framework.
A project originally for an undergraduate Freshman seminar on motion planning algorithms. Provides a basic interface for drawing obstacles in a 2-D plane and the ability to select an algorithm by which to plan a path in this user-defined world.