Ideal for IT departments and MSPs (managed service providers)
Your IT essentials, integrated & elevated. Take your IT management from automated to autonomous, download Atera's agent to start your free trial!
Try Atera now
Enterprise-grade ITSM, for every business
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.
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).
...
Water Retention on Magic Squares with Constraint-Based Local Search
A Constraint-Based Local Search solver for the Water Retention on Magic Squares-problem.
The problem is a very hard combinatorial optimisation problem, invented by Craig Knecht. More can be read about it at:
http://en.wikipedia.org/wiki/Water_retention_on_mathematical_surfaces
Craig's website for the problem:
http://www.knechtmagicsquare.paulscomputing.com/
The solver is mainly based on the theory and ideas from my bachelor thesis, which I wrote at Uppsala University, Sweden, for the Astra Group which does research about Constraint Programming and related technologies:
Water Retention on Magic Squares with Constraint-Based Local Search
http://urn.kb.se/resolve?...
CADI is an implementation of the JPIP standard (JPEG2000 Interactive Protocol - Part 9). CADI includes a JPIP server, a JPIP proxy, and a JPIP Client. CADI is designed and programmed with the aim to provide a flexible framework to test and develop ne
Transform your applications and workflows into powerful agentic systems at global scale.
Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
the c prototyping tools library provides thread-safe linked list, priority queue, hash table, hash list, AVL tree and trie implementations, as well as a thread pool and thread management framework, a tcp and http socket api, and a dbms abstraction layer.
JaNaG is a Java random name generator for role-games, authors, and the like. It is based on a name fragment database that creates relatively reasonably sounding names. It can run as applet, GUI appliance, command line tool, or on a server-client basis.
http://www.open-source-soft.narod.ru/VoiceDetector.7z It voice detector class,for detecting human speech, anti noise, anti tones, standard C++, completely cross-platform by recompilation.
http://jocdelavida.piposerver.com - Online implementation of Conway's Game of the Life 0 players game, but using entities based on the nature, like animals or plants who born, grow up, reproduces breed and die. Written in Java 6 and Adobe Flex 3.
TimeFinder automatically optimizes schedules (timetables) for universities and high schools. It makes manual timetabling for the timetabler easier via a Java GUI. Export+import is supported via xml and text formats. http://timefinder.sourceforge.net/
With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You 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.
The Boehm-Demers-Weiser conservative garbage collector. The CVS source of the version 7+ collector resided here for a while, but is now on github. Other information and release snapshots are currently at http://hboehm.info/gc
A log player for "The Fourth Coming" ("T4C", http://www.the4thcoming.com).
Given a log-file, this tool will replay a T4C game you've played before.
It will have built-in functionnalities like : merging log files
together, searching and cleaning
Now part of Apache's Mahout machine learning project at http://mahout.apache.org/-- please see there for latest info and code and releases and support!
Three software packages to work with RFC2617 digests: libdigest (C library to compute digests), libcppdigest (C++ library to manage /etc/passwd-like files) and libpam-digestfile (PAM module allowing authentication via an /etc/passwd-like file)
The library currently consists of an implementation of collision detection of static/moving ellipsoids that exploits frame-coherence using separating planes. Please visit http://www.cs.hku.hk/GraphicsGroup/cd.html for paper references.
!!! The project has been renamed to "libanculus-sharp" and has been moved to googlecode : http://code.google.com/p/libanculus-sharp/ !!! LibCommon is a reusable library written in C#. It runs on Mono 1.2 or higher and .NET 2.0 or higher. It provides an
OCaml-Reins is a data structure library for O'Caml that includes cursor based iterators, a collection of functors to minimize client-side boilerplate, a powerful on-line benchmarking system and Quickcheck style testing infrastructure.
Automated computer program grading solutions designed for trainings on computer languages, data structures and algorithms. See http://openjudge.net for details.
A Python library for easy creation and manipulation of Google Earth KML and KMZ placemark files.
Please get your copy from http://pykml.cvs.sourceforge.net/viewvc/pykml/pykml/?view=tar
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/.
Open Source IM and voice client using Jabber and SIP protocols, with great audio quality thanks to speex and a nice and clean interface. Programmed in Java and C++. It supports chat, voice and file transfers.