Search Results for "linux-gnome" - Page 30
Sort By:
Showing 1269 open source projects for "linux-gnome"
View related business solutions-
Retool your internal operationsBuild internal software that meets enterprise security standards without waiting on engineering resources. Retool connects to your databases, APIs, and data sources while maintaining the permissions and controls you need. Create custom dashboards, admin tools, and workflows from natural language prompts—all deployed in your cloud with security baked in. Stop duct-taping operations together, start building in Retool.
-
Atera all-in-one platform IT management software with AI agentsAtera’s AI agents don’t just assist, they act. From detection to resolution, they handle incidents and requests instantly, taking your IT management from automated to autonomous.
-
1
The package edmonds-alg contains a C++-implementation of Edmonds's optimum branching algorithm as described by Tarjan in 1977.
-
2
Implementation of Multikey Quickselect and new Multikey Quicksort variants in Frias L, Roura, S. Multikey Quickselect. Technical report LSI-09-27-R, Universitat Politècnica de Catalunya, 2009. http://www.lsi.upc.edu/dept/techreps/techreps.html.
-
3
This is the extended euclidean algorithm implemented in haskell. It will put every single step of the algorithm in a file and show the actual result and everything in between.
-
4
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
-
Total Network Visibility for Network Engineers and IT ManagersThis means every device on your network, and every interface on every device is automatically analyzed for performance, errors, QoS, and configuration.
-
5
Some utility function and/or class to convert date from Gregorian calendar to Jalali (Hejri Shamsi) calendar in PHP, Delphi (and some other in future) with very fast algorithm.
-
6
Implementation of cache conscious STL lists in Frias, L., Petit, J., and Roura, S. 2009. Lists revisited: Cache-conscious STL lists. J. Exp. Algorithmics 14 (Dec. 2009), 3.5-3.27. DOI= http://doi.acm.org/10.1145/1498698.1564505
-
7
An implementation of LAYAGEN G(Diego-Mas 2010) for solves the layout planning problem using a simple genetic algorithm, and fully written in GAMBAS
-
8
A simple component usable for converting a non-deterministic finite automaton to a deterministic finite automaton.
-
9
This project implements insert and remove operations on AVL trees. Comments in the source explain the implementation. Test applications perform a run-time check of insert and remove methods. A bash script builds and executes the test applications.
-
Free and Open Source HR SoftwareGive your HR team the tools they need to streamline administrative tasks, support employees, and make informed decisions with the OrangeHRM free and open source HR software.
-
10
Kuhn-Munkres is used inside assignment problem solver application. Instance generator application creates input file for the solver. Checker application verifies the solution computed by the solver. A bash script compiles, executes these apps.
-
11
It's a simpler clone of RoboCode. It's a game which simulates tanks war. The focus is artificial intelligence AI, evolutive algorithms and neural networks. It's implemented in Java.
-
12
On open source MPI implementation of parallel bucket sorting. This implementation is scalable and gives linear speedup on SGI(Altix). The program sorts at using the bits and hence is stronger than other sorters which make assumptions about keys.
-
13
This is an Ada implementation of the Dancing Links X Algorithm as in Donald E. Knuth paper. AdaDLX is used to solve the Eight-Queens puzzle, Sudoku grids and Blocs in Box puzzle.
-
14
AVL Array is a sequence container (like std::vector or std::list) that allows fast insert/remove AND fast random access. Shiftable Files offers the usual file primitives plus fast insert/remove. Get the latest version via BZR in the Develop section.
-
15
The MemSL for C and C++ includes a complete data structures/collection classes library, memory tracing, memory debugging, logging, entry/exit tracing, exception handling, definable memory handlers, built-in threads support and much more.
-
16
Graphserver provides fast shortest-path computations on very large graphs, for use as a sub-component of a trip-planning service.
-
17
Alef++, is a new programming language like Perl and Lisp syntax, with a many changing in classical languages designs, her specification designed to be implemented for any VM, by default can access to any private/protected/default Java fields or methods.
-
18
This sofware is designed to help different chess clubs to set up their own rating system. It uses USCF approximation formulas for rating calculations. Working example at newarkcc.vfutbole.ru
-
19
Turn-based strategy game for developers/technical experienced users, based on neural networks, algorithmic programming languages and other techniques.
-
20
Spreadsort is a fast general-case in-place hybrid radix/comparison algorithm, which tends to be roughly twice as fast as std::sort. This library has calls to sort integers, floats, or strings, or other data types based upon integer, float, or string keys
-
21
-
22
-
23
This project has moved and is not any longer developed. Please see http://sibirjak.com/blog/index.php/lite-collections/ for more details.
-
24
A library including the whole bunch of standard algorithms in graph optimization and drawing. On top of this, a GUI for manipulating and editing of graphs.
-
25
libease is a shared library containing easing methods that can be used for graphical effects or mathematical calculations.
