Search Results for "open-shell" - Page 15
Sort By:
Showing 1127 open source projects for "open-shell"
View related business solutions-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
An optimized java library for genetic algorithms. The library is designed to be fast and memory light, but still very easy to use.
-
2
Open Object Oriented ANSI C provide API to build Object Oriented application in ANSI C language. It provide common base classes that allow inheritance to develop application with your own reusable objects, and smart exception recovery support
-
3
WM Hyperintensities Segmentation Toolbox
Open Source White Matter Hyperintensities Segmentation Toolbox
Wisconsin White Matter Hyperintensity Segmentation [W2MHS] and Quantification Toolbox is an open source MatLab toolbox designed for detecting and quantifying White Matter Hyperintensities (WMH) in Alzheimer’s and aging related neurological disorders. WMHs arise as bright regions on T2- weighted FLAIR images. They reflect comorbid neural injury or cerebral vascular disease burden. Their precise detection is of interest in Alzheimer’s disease (AD) with regard to its prognosis. -
4
Damerau Levenshtein
Java Library for Damerau Levenshtein Algorithm
-
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
5
matrix.h
Some basic matrix algorithms implemented in C
This is a collection of some matrix algorithms like matrix inverse, LU decomposition, Gauss elimination, matrix multiplication, matrix pow, matrix add, matrix subtract etc. This package also contains debugging information for the above algorithms -
6
gridrpcdm
Library implementing the GridRPC and GridRPC DM OGF stantards.
This library is a common implementation of both the Open Grid Forum GridRPC API _and_ GridRPC API Data Management standards. It is completely modular and already supports middleware modules for DIET and Ninf, as well as data manager modules for iRods, OwnCloud, rsync, scp. The installation is made easy with cmake and testing examples can be launched in a one line command. -
7
DDMTestbed
An independent Data Distribution Management testbed
DDMTestbed is a testbed that allows you to generate random instances and evaluate your proposed resolutive method measuring execution time, memory occupied and distance from the optimal solution. It has been written in C language. -
8
Java generic Iterator implementation to generate permutations and combinations. Uses the algorithm described here http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm#Even.27s_speedup and the clear description of that algorithm here: http://www.cut-the-knot.org/Curriculum/Combinatorics/JohnsonTrotter.shtml
-
9
Critterding
Evolving Artificial Life
Critterding is a "Petri dish" universe in 3D that demonstrates evolving artificial life. Critters start out with completely random brains and bodies, but will automatically start evolving into something with much better survival skills. -
8 Monitoring Tools in One APM. Install in 5 Minutes.AppSignal works out of the box for Ruby, Elixir, Node.js, Python, and more. 30-day free trial, no credit card required.
-
10
ImpPath
Simple C++ library for path manipulation
Very basic path manipulation library. Aims to be simple, intuitive and predictable (not universal). Works with std::string and std::wstring. Configurable to support both POSIX and Windows paths (drive letters only - no schemas, network paths etc), as well as some custom formats (with limitations for simplicity). All configurations understand ".." (parent directory) and "." (current directory) and handle them during normalization. However, this library never tries to access any real... -
11
-
12
JSolutions
The solution to all your problems
The Jsolution package is a collection of programs, scripts,libraries and documents that i have written and use in my daily life. -
13
Dantzig-Wolfe Solver
An implementation of Dantzig-Wolfe decomposition built upon GLPK
An implementation of Dantzig-Wolfe decomposition built upon the GNU Linear Programming Kit. This is a command line tool for solving properly decomposed linear programs. There are several examples and some documentation to guide the use of this solver. Forked over to GitHub (see link). -
14
Shobhit-Improved String Search
SHOBHIT-Improved String Search is new improved string search algorithm
In Computer Science, SHOBHIT-Improved String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in August, 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first, last, mid1 and mid2 index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. Its best case, time complexity is O(m/4) and in worst case, time complexity is O(n – (m/4) ). In all the... -
15
-
16
-
17
OpenAIL
Open Artificial Intelligence Library
[Open Artificial Intelligence Library]. This library main goal is to provide a tool box to those who want to use algorithm such as neural network or genetics Algorithm and all algorithms that are commonly within the Artificial Intelligence field. -
18
SHOBHIT-Advance String Search
SHOBHIT-Advance String Search is a pattern search Algorithm
In Computer Science, SHOBHIT-Advance String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first and last index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. Its best case, time complexity is O(m/2) and in worst case, time complexity is O(n – (m/2) ). In all the cases best, average and... -
19
-
20
SourScript
An open source REPL (Read - Eval - Print Loop), made just for fun.
An open source REPL (Read - Eval - Print Loop), made just for fun. It was initially developed by MrMojoRisin5. Uses Python 2.7.4. -
21
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...
-
22
-
23
QRealFourier
Qt-based FFT implementation
A Qt library for Fast Fourier Transform (FFT) of real samples. Based on the FFTReal library. -
24
-
25
The Safe C Library provides bound checking memory and string functions per ISO/IEC TR24731. These functions are alternative functions to the existing standard C library that promote safer, more secure programming. The ISO/IEC Programming languages — C spec, C11, now includes the bounded APIs in Appendix K, "Bounds-checking interfaces". This latest upload supports building static library, a shared library and a linux kernel module.
