Search Results for "search"
Sort By:
Showing 40 open source projects for "search"
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.
-
Stop vibe-debugging.AppSignal's MCP server hands Claude, Cursor, or Zed your real errors, traces, and the deploy that shipped them. AI writes the fix; you review the diff.
-
1
MathCode
A Frontier Mathematical Coding Agent
...It is designed to transform plain-language mathematical reasoning into verified Lean 4 code and formal proofs. The project combines AI agents with Lean Language Server Protocol integration, allowing it to inspect compiler feedback, search for lemmas, and iteratively repair failed proof attempts. It supports an agentic proving workflow where the system behaves more like an interactive mathematical engineer than a one-shot text generator. MathCode also includes visualization-oriented tooling such as theorem graph generation for Obsidian knowledge workflows. Its main value is bridging natural-language mathematics with formal verification systems in a way that is more automated, inspectable, and iterative than traditional theorem-proving pipelines. -
2
ntuacarlo
A open-source implementation library of optimization algorithms
ntuacarlo: library of open-source implementation of optimization algorithms for Matlab/GNU Octave The library implements matlab functions for the following optimization algorithms: Simulated Annealing Particle Swarm Optimization Monte Carlo Exhaustive search The signature of the functions follow the same as the ga() function of Matlab. All the functions support lower and upper bounds, linear and non-linear constraints, and integer variables.Octave -
3
PI-Based Image Encoder / Converter
Python code able to convert / compress image to PI (3.14, π) Indexes
Image processing tool that encodes pixel data as indices within the first 16.7 million digits of PI (π). Features high-performance Numba-accelerated search and a signature 'film-grain' aesthetic upon reconstruction. ZIP also include 16 MB file with 16,7 mil numbers of PI Benchmark(Single-Thread): Hardware & Environment Apple Silicon: Apple M2 (Mac mini/MacBook) x86_64 Platform: Intel Core Ultra 5 225F (Arrow Lake, 10 Cores) OS 1: Fedora 43 (GNOME) OS 2: Windows 11 Pro (23H2/24H2) Software: Python 3.14.3 + Numba JIT (latest) Results (Lower is better) Platform / OS CPU Time (Seconds) macOS (Native) Apple M2 52.151311 s (in default setup) Fedora Linux Intel Core Ultra 5 225F 58.536457 s (in default Power Management: Balanced) Windows 11 Intel Core Ultra 5 225F 59.681427 s (important! ... -
4
TXM
Unicode XML TEI text analysis platform
...DOWNLOAD LATEST VERSION OF TXM : http://textometrie.ens-lyon.fr/spip.php?rubrique61&lang=en TXM offers a comprehensive range of analysis tools (concordances, collocate search, frequency lists, etc.) based on the powerfull CQP full text search engine (http://cwb.sourceforge.net) and a range of statistical functions (factorial analysis, classification, cooccurrency analysis, etc.) based on R packages (http://www.r-project.org). Read the scientific background at the Textométrie project web site http://textometrie.ens-lyon.fr/?... -
Enterprise-grade ITSM, for every businessFreshservice 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.
-
5
MLPACK is a C++ machine learning library with emphasis on scalability, speed, and ease-of-use. Its aim is to make machine learning possible for novice users by means of a simple, consistent API, while simultaneously exploiting C++ language features to provide maximum performance and flexibility for expert users. * More info + downloads: https://mlpack.org * Git repo: https://github.com/mlpack/mlpack
-
6
Chuck Coleman's SAS Codes
SAS Codes
...Directories under "Files" with descriptions: NESUG 2014: "A Fast, High-Precision Implementation of the Univariate One-Parameter Box-Cox Transformation Using the Golden Section Search in SAS/IML®" SESUG 2017: "Decomposing the R-squared of a Regression Using the Shapley value in SAS®" SESUG 2019: "Conditionally Executing Data Steps and Statements Based on the Presence of Variables in a SAS® Dataset" GASP 2020: "Online Winsorization of the Survey of Construction’s Price Estimates" My SESUG 2015 materials can also be found in my project "constrainingarrays" at https://sourceforge.net/projects/constrainingarrays/. -
7
FiboSearch
Efficiently locate minumum of function of non-negative integer
Fibonacci search for functions! Given a real-valued function of a non-negative integer with one minimum at i in {0, 1, 2, ..., n} and no local minima, efficiently locate that minimum in log (n) time. -
8
mssolutions
Makes magic squares.
These programs make magic squares and rectangles using "Constraint-Based Local Search". (For non-square rectangles, input the order as two numbers.) There are 3 similar programs: CompleteSquare, CompleteSquareSteps, and MagicSquares. Given an input square with some cell values between 1 and NxN specified, (and other cell values 0), CompleteSquare attempts to complete a magic square by placing the remaining values. -
9
NOMAD is a C++ code that implements the MADS algorithm (Mesh Adaptive Direct Search) for difficult blackbox optimization problems. Such problems occur when the functions to optimize are costly computer simulations with no derivatives.
-
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.
-
10
popt4jlib
Parallel Optimization Library for Java
...Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known network flow and other graph algorithms. A fast parallel implementation of the network simplex method, and some full-fledged parallel/distributed MIP solvers will be added in the next version. In general, emphasis is given in improving the efficiency of the algorithms in shared-memory models via java threads, since multi-core machines are so wide-spread today. -
11
hn++
Two Neighbours and Hermitian Neighbours in C++
...Building upon those ideas and the older celebrated programs TN and HN, HN++ contains various methods to analyse invariants of the constructed lattices as well as more randomized algorithms to quickly search through large genera. -
12
MorseClusterSolver
The program is designed to search for clusters global minimum structur
The program is designed to search for clusters global minimum structures of Morse clusters. -
13
Maps coloring
Four color theorem application
Search for a pencil and paper proof of the four color problem. See http://4coloring.wordpress.com for info. Please let me know what you think about this application. Also visit the youtube channel: http://www.youtube.com/user/mariostefanutti/videos -
14
Primes
Calculate primes by using extremely fast sorting
This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for... -
15
DD-AVX
DD-AVX: Library of high-precision operations accelerated by AVX
...After merge "lis" and "DD-AVX," the interface is same as "lis." Lis web page http://www.ssisc.org/lis/index.en.html This library is managed by git. old version can search "code" page. -
16
Bibtex Import
Imports bibtex references from MathSciNet
Uses MathSciNet to search for bibtex references. The matching references can then be edited and added to a local file. For information on how to use this software please consult the wiki. Requires a MathSciNet subscription. -
17
PyGAO
Genetic Algorithm Optimization for Python
...I am starting with a stripped-down version, where a solution can be described using a single vector of float numbers. Eventually, I will expand to more generic data structures and add multiple-species search options. For the time being, I have no plans of developing a GUI. For now, this is strictly a computational module. In addition to the standard Python libraries, PyGAO uses numpy. -
18
Octclipse
Octave Eclipse GUI
Octave development environment built upon Eclipse's Dynamic Languages Toolkit (http://www.eclipse.org/dltk/). Distributed as an Update site for Eclipse 3.7 Indigo and Indigo-based package for several platforms. Supports search, autocompletion, launching scripts, interactive console, debug and integrated plotting on Octave versions 3.2.x, 3.4.x and 3.6.x. The current goal is to make it running out-of-box on multiple platforms. Currently only Linux and Windows are supported. Mac support is possible. The project needs a maintainer for Mac version, since I don't have Mac to build Octclipse and test it on this platform. ... -
19
Large Scale Optimization Templates
C++ templates with generic nonlinear optimization algorithms
Highly tunable, simple to use collection of the templates, containing a set of classes for solving unconstrained large scale nonlinear optimization problems. Currently it contains: -- Limited Memory Quasi Newton (L-BFSG) -- BFSG -- Conjugate Gradient -- Gradient Descent -- Wolf condition Line Search -- Backtracking Line Search -- Exact Golden Search -- Golden Search with Wolf condition We also distribute a set of tests with the library. -
20
StatsCollect is a little framework gathering statistics from external sources (social networks, web sites...), stored in pluggable backends. It can be very easily extended thanks to its plugins (currently include Facebook, Myspace, Youtube, Google).
-
21
knowceans
Utility classes from maps to search engine to random samplers
.... --- Highlights: --- org.knowceans.util: IndexQuickSort, TableList: apply order of one array/list to others +++ Vectors, ArrayUtils: array convenience +++ RandomSamplers, CokusRandom, ArmSampler, Densities: random sampling and distributions +++ Arguments: command line parser +++ StopWatch, Which, ExternalProcess: runtime stuff +++ ParallelFor: OpenMP workalike +++ PatternString, NamedGroupRegex: regex convenience --- org.knowceans.corpus: CorpusSearcher: full-text search engine +++ LabelNumCorpus: svmlight corpus storage and filtering +++ NIPS corpus with text, authors, labels and citations --- org.knowceans.map: InvertibleHashMultiMap, BijectiveHashMap: implement n:m and 1:1 relations. --- Other libs: knowceans-arms = port of the Adaptive Rejection Metropolis Sampler (ARMS) for arbitrary distributions +++ lda-j = port of lda-c, implementing Latent Dirichlet Allocation (LDA) -
22
Fits and scores vertices from models onto reference vertices to find its polyhedral identity and symmetry quantitatively. Java based with GUI
-
23
The Kyoto FST Decoder is a general decoding engine for Weighted Finite State Transducers. It features flexible XML-based configuration, beam-search decoding, and is able to output separate weights for weight tuning.
-
24
Fast search using a standard SQL on Oracle or PostgreSQL database. The package includes the database creator, loader and web application. It supports SMILES and SMARTS substructure searches, similarity search, stereochemistry.
-
25
SURIKATA (Syntactic Universal Reasoning for Inducing Kolmogorov Abstract Theories Automatically) is a system for searching large spaces of artifacts and inducing algorithms for generating similar artifacts.
