Search Results for "boolean"

mXparser is highly flexible parser of math expressions. Software provides easy to use API for JAVA, Android, C# .NET/MONO (CLS). Main functionalities: - basic operators, i.e.: +, -, *, ^, ! - Boolean logic operators i.e.: or, and, xor - binary relations i.e.: =, <, > - math functions (large library of 1-arg, 2-arg, 3-arg - - functions) i.e.: sin, cos, Stirling numbers, log, inverse functions - constants (large library), i.e.: pi, e, golden ratio - n-args functions i.e.: greatest common divisor - iterated summation and product operators - differentiation and integration High flexibility: - user defined constants and arguments, both free - and dependent on other arguments + possibility of use in functions - user defined functions (both free and depended) - user defined recursive arguments + simple (controlled) recursion (1 recursive argument) - user defined recursive functions / expressions (any) - complex, many arguments, no limitation - internal syntax checkin

opbdp is an implementation in C++ of an implicit enumeration algorithm for solving (non)linear 0-1 (or pseudo-Boolean) optimization problems with integer coefficients. A research report describing the techniques used in opbdp is included.

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.

KeplerDB is a temporal database to store time/value entries where the type of value could be integer, float/double, boolean and string. KeplerDB is dedicated to be scalable and to create clusters of server allowing the user to analyse and store massing amount of data to monitor systems like computers, clusters, building and captors or financial systems like markets and accounts. The user can use KeplerDB to make data analysis on enormous amount of data (statistics and modelling).

PolyBoRi is implemented as a C++ library for Polynomials over Boolean Rings, which provides high-level data types for Boolean polynomials. A python-interface yields extensible algorithms for computing Groebner bases over Boolean Rings.

iVSwap is a simple function which can be used as a library and swaps values between two variables in a mathematical way using a classic Boolean algebra law without the need of a buffer! The advantages of this technique is speed and portability.

Portable scientific program to calculate any boolean expressions with a powerful and easy-to-learn scripting language. Programmed in ANSI-C++.

CNF-toolkit is a simple library for constructing and manipulating boolean formulae in conjunctive normal form.