Search Results for "32-bit"

Algorithms is an educational Java repository containing tested solutions to common computer science and programming problems. It covers binary trees, linked lists, strings, bit operations, mathematics, sequences, arrays, sorting, and miscellaneous interview-style exercises. Many categories contain several related problems so learners can compare recurring techniques and data structures. Some problems include more than one implementation, allowing different approaches to be examined side by side. Every solution is accompanied by tests, and part of the repository was developed using test-driven development. ...

...Also available on github since 2015/12/13: https://github.com/jeffhain/jafaran Principal classes: - Implementations using Mersenne-Twister algorithm (good pseudo-randomness): MTSyncRNG MTSeqRNG - Implementations using Marsaglia Xor-Shift (fast): MXSIntSeqRNG (32 bits) MXSLongSeqRNG (64 bits) (nextLong() faster, larger period) - Ziggurat: Random-based implementation of Ziggurat algorithm.

AlgART Java libraries for processing arrays and matrices are open-source product, distributed under MIT license. So, anyone can use them for free without any restrictions. Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over matrices, etc. - please see at the site. ...

EZvolve Foundation Classes is a set of data types and utility classes for use with evolutionary algorithms. Currently implemented support for bit string encoding, populations, fitnesses, fitness functions, probabilities, and probability vectors.