Search Results for "cron-o-meter windows"
Sort By:
Showing 25 open source projects for "cron-o-meter windows"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
Ship Agents FasterGemini 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.
-
1
DifferenceKit
A fast and flexible O(n) difference algorithm framework
A fast and flexible O(n) difference algorithm framework for Swift collection. The algorithm is optimized based on the Paul Heckel’s algorithm. This is a diffing algorithm developed for Carbon, works stand alone. The algorithm optimized based on the Paul Heckel’s algorithm. See also his paper A technique for isolating differences between files released in 1978. It allows all kind of diffs to be calculated in linear time O(n). RxDataSources and IGListKit are also implemented based on his... -
2
Arduino
Open-source electronics platform
Arduino is an open-source physical computing platform based on a simple I/O board and a development environment that implements the Processing/Wiring language. Arduino can be used to develop stand-alone interactive objects or can be connected to software on your computer (e.g. Flash, Processing and MaxMSP). The boards can be assembled by hand or purchased preassembled. Arduino is a popular tool for IoT product development as well as one of the most successful tools for STEM/STEAM education.... -
3
VISUALG 3.0
VISUALG versão 3.0.7.0 (última de revisão 21/03/2019) release OK
Autor ANTONIO CARLOS NICOLODI, 38 anos na área de informática como: Analista de sistemas, desenvolvedor de softwares em várias linguagens de programação: C++, Assembly, Pascal(Delphi), Basic, Cobol, Clipper, Java, etc. Refiz esta nova versão e estou disponibilizando GRÁTIS o: "VISUALG 3.0". Entre outras : (novo layout, nova roupagem até 05 tipos de peles) e novos comandos, também reconhece comandos em português correto: ( PARA ... FAÇA, SE .. ENTÃO .. SENÃO) e o operador lógico NÃO, mas... -
4
√Math Xplorer
Phần mềm toán học dạng Nhập - Xuất | Math App I/O Type
VMath is a free math console. Currently the project is work only with Windows. For other OS please download Wine. -
Secure File Transfer for Windows with Cerberus by RedwoodCerberus supports unlimited users and connections on a single IP, with built-in encryption, 2FA, and a browser-based web client — all deployable in under 15 minutes with a 25-day free trial.
-
5
bs
A B-tree based sequence library.
BS is a data structures library. It features fixed data size, random access sequences. The sequences are constructed over B-trees. Complexity for most single item operations is about O(logN). -
6
DJVU++
The DjVu complete solution,with OCR Technology(Arabic ,English).
DjVu++ is a user-friendly program that used to manipulate DjVu file formats such as eBooks with a penalty of editing features. The program introduce a free replacement for the property PDF format with similar resolution and smaller file size DjVu++ also support OCR to handle text in scanned books and images. The program shows good performance for English. In addition to the Arabic language to lead free and commercial software in this area. The main features of DjVu++ program are: o... -
7
HitCrypt
Descritografar e Criptografar XMLs do Tribunal de Justiça
O HitCrypt é uma ferramenta que pode ser utilizada para Decryptar o arquivo de Selos e Encryptar. Inicialmente este aplicativo está preparado para funcionar para o tribunal de justiça do estado de Minas Gerais. -
8
Javascript-Voronoi
JS implementation of Fortune's algorithm to compute Voronoi cells
This repository implements Steven Fortune’s algorithm (sweep-line method) for generating Voronoi diagrams in JavaScript, providing a performant browser-side solution for computational geometry of planar point sets. With this library you can feed a set of sites (points) and compute their Voronoi cells – the partition of the plane into regions closest to each site – in O(n log n) time. It’s especially useful in web UIs, visualizations, interactive maps, and generative-art contexts where you... -
9
Ginors Sort
sorting algorithm for binary keys
in-place sorting algorithm with O(n*log(k)) time komplexity. The data have to be the structure: struct { unsigned (char/short/int/long); [...] } -
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.
-
10
deapheap
Deap is a doubly heap for both min and max number access.
A deap is a doubly priority queue for efficient data operations. Both insertion and deletion operations take O(log(N)) time. Access of min or max takes constant time. It can be useful when both min and max are needed in the queue. It can also be used in situations where the number of items is too large and items with low priorities can be dropped with keep memory footprint small. -
11
Programming Accessory Kit
PAK is a collection of library code to handle the overhead of coding
PAK is a collection of library code to handle the overhead of coding things like read-write locks, reflective multithreaded programming and simple file io. This is a java library collection, please see my API below... -
12
A capsule tree is a general purpose, self-balancing tree data structure for large, ordered, data-sets. It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases. The original motivation for this tree was a better backend for memory managers. However, the end result was a new sub-category of trees. The implementation giving here is just one implementation of...
-
13
Approximate Subgraph Matching Algorithm
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,... -
14
LBP in multiple platforms
LBP implementation in multiple computing platforms (ARM,GPU, DSP...)
The Local Binary Pattern (LBP) is a texture operator that is used in several different computer vision applications and implemented in a variety of platforms. When selecting a suitable LBP implementation platform, the specific application and its requirements in terms of performance, size, energy efficiency, cost and developing time has to be carefully considered. This is a software toolbox that collects software implementations of the Local Binary Pattern operator in several... -
15
Exact Subgraph Matching Algorithm
Exact Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. We designed a simple exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach. The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree. We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue... -
16
A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit finds and iteration. Is approx. 50-100% faster than red-black trees and up to 20% faster than O(1) hash tables.
-
17
webscool
Tcl library of packages focusing on functional principles
Individual collection of operational Tcl packages which employ functional programming principles including currying and lambda expressions. Also set and monad structures and algorithms from Knuth, and a Chu Space Calculator with an efficient implementation of the -o implication operator which enumerates the continuous functions from one space to another. -
18
This is a series of *.java Classes for making programming tasks simpler, much like Apache Commons. Included in this src package is an Advanced Randomizer, TStringList Clone From Delphi, an Algorithem Class, and Method MultiTask Better than Runnables.
-
19
-
20
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.
-
21
Genijatorics is a library providing solutions to enumerative combinatorial problems. The most prominent example of its use is for generating events in specified date range from CRON-like descriptions. It also serves for educational purposes.
-
22
A simple (~20 line python) O(n^6) algorithm for the traveling salesman problem that seems to do pretty well for most graphs; so well that I have not been able to find a graph which it does optimally solve. Those with spare cycles are welcome to help out.
-
23
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.
-
24
A library to build and manipulate finite state automata, I/O automata, transducers and rational langagues in Java.
-
25
This project aims at providing a set of tools for solving the class of monodimensional packing problems (such as cutting stock, bin packing and knapsack problem) mainly using genetic algoritms.
- Previous
- You're on page 1
- Next
