Search Results for "linear" - Page 3
Sort By:
103 projects for "linear" with 2 filters applied:
-
$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.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
1
...The base of available algorithms is steadily increasing and includes signal processing methods (Principal Component Analysis, Independent Component Analysis, Slow Feature Analysis), manifold learning methods ([Hessian] Locally Linear Embedding), several classifiers, probabilistic methods (Factor Analysis, RBM), data pre-processing methods, and many others.
-
2
The JTS Topology Suite is an API for modelling and manipulating 2-dimensional linear geometry. It provides numerous geometric predicates and functions. JTS conforms to the Simple Features Specification for SQL published by the Open GIS Consortium.
-
3
Bat2015
Bachelor of Science (Informatik)
The toolkit glpk supports methods for mixed integer linear programming (MILP). These methods solve Capital Budgeting Problems (CBP). Unfortunately, glpk does not support any multithreading and there is no feature to distribute problems via network connections. Today, this is a pitiable sight, because modern computer systems are coupled by networks and support multi threading. We create a distributed system with Apache thrift and the C-API of glpk. -
4
TreeLayout
Efficient and customizable TreeLayout Algorithm in Java, for NetBeans
Efficiently create compact, highly customizable tree layouts - Based on Walker's algorithm with enhancements suggested by Buchheim, Jünger, and Leipert the software builds tree layouts in linear time. I.e. even trees with many nodes are built fast. Downloads are available at https://sourceforge.net/projects/treelayout/files/. For detailed documentation look at the TreeLayout web site http://treelayout.sourceforge.net/. Development for TreeLayout has moved to https://github.com/abego/treelayout/. -
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
math lib for .NET. n-dim arrays, complex numbers, linear algebra, FFT, sorting, cells- and logical arrays as well as 3D plotting classes help developing algorithms on every platform supporting .NET. Sources from SVN, binaries: http://ilnumerics.net
-
6
JChart2D
jchart2d is a real-time charting library written in java.
JChart2D is a easy to use component for displaying two- dimensional traces in a coordinate system written in Java. It supports real-time (animated) charting, custom trace rendering, Multithreading, viewports, automatic scaling and labels. Former UI controls (right click context menu, file menu) have been ported to the subproject jchart2d-uimenu (https://sourceforge.net/projects/jchart2d-uimenu.jchart2d.p/) for the benefit of having no dependencies to 3rd party libraries. -
7
ocaml-glpk
OCaml bindings for GLPK
OCaml bindings for the GLPK (GNU Linear Programming Kit) library for solving linear programming and mixed integer programming problems. -
8
CVM C++ Class Library encapsulates concepts of vector and square, band, symmetric and hermitian matrices in Euclidean space of real and complex numbers. It utilizes BLAS and LAPACK Fortran libraries. See http://cvmlib.com for binaries and more details.
-
9
JBernstein
JBernstein: Exploration techniques for non-linear constraint checking
JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance,... -
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.
-
10
ivl
A C++ template library extending syntax towards mathematical notation
...ivl includes a rich set of functions and operators, including operations for image processing. Seperate modules are also included. The module ivl-lina implements a linear algebra LAPACK wrapper. The module ivl-cv integrates OpenCV into ivl. -
11
math toolkit
A C++ and Python library for finance, statistics and linear algebra.
A lightweight C++ and Python library for finance, statistics and linear algebra. Finance features include compound rate present/future value, annuity, various present/future value coefficients ... Statistics features include mean, median, variance, standard deviation, covariance, correlation, linear regression, probabilities and random variates of various distributions ... Linear algebra features include matrix arithmetic, inverse, determinant, rank, linear system solution, lu/qr decomposition, svd, eigen values/vectors ... ... -
12
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). -
13
This is an interpreted programming language that is designed to teach young children the fundamentals of programming, hiding away from students the complex concepts of programming, such as parentheses, quotes, data types, arrays, while allowing them to understand the basic concepts of programming, and, move to a more advanced language. It also serves as an exapmle on how to create an interpreter with QBASIC. The interpreter is written in QBASIC, and is licensed under the GNU...
-
14
PopED (Population Experimental Design) is a software tool for computing optimal experimental designs. The software has been developed with an emphasis on drug trials based on population models (non-linear mixed effects models).
-
15
EGNLA
Heterogeneous cluster for acceleration of linear algebra computations
This project deals with a new concept of the heterogeneous grid for acceleration of the numerical linear algebra computing. We design this grid with respect to maximal ratio between cost and computational power. It allows a parallelization of scientific codes with minimal programming effort. We also optimize grid concept to be less sensitive to network parameters. -
16
Galois sub-hierarchy builder
Visualize Galois sub-hierarchy of 2d matrix
GSH builder is a free Galois Sub-Hierarchy visualization tool. The algorithm for calculating GSH is called Pluton and the present Java realization is based on two articles. "Efficiently computing a linear extension of the sub-hierarchy of a Concept Lattice" by Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret and Jeremy P. Spinrad. "Performances of Galois Sub-hierarchy-building algorithms" by Gabriela Arevalo, Anne Berry, Marianne Huchard, Guillaume Perrot and Alain Sigayret In you're in need of other GSH algorithms or their realizations in C++, you might want to investigate a project called Galicia on sourceforge. ... -
17
fiftyfifty
fiftyfifty is a programming language and game
...The head itself sort of sits between the two trees, but will often change its state according to information from the right side of the left side. In 5050, the state of the head itself is again represented as a tree of commands, although for simple programs, a linear representation can be sufficient. -
18
HASEM
Matrix c++ library solving any linear algebra problems
...With over 200 member functions and over 40 none member functions HASEM is almost able to solve any linear algebra problems. HASEM support multidimensional as well, you can mix up your multidimensional matrix with other matrices with different size, and apply all operations on them as well.It's possible to save the computed matrix into files, and when required read it from files and load the data into matrices. It is also very easy to add your extension to HASEM. -
19
Zero Sum Game Solver Java Library
Zero Sum Game Solver Java Library
Zero Sum Game Solver Java Library is open source java library to solve 2-player finite zero-sum games. This programs solve zero-sum games with linear programming. -
20
Coupling the notion that during the search for the minimum of a function we must pass through its solution with a PSO solution generator engine, is the approach for solving, in time domain, a non-linear algebric-differential system of equations.
-
21
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.
-
22
JSort is a library with some sorting algorithms implementation and related data structure. It has compare-based algorithms, linear sorting, graph sorting, priority based queue, and so on.
-
23
Its an Eclipse 3.5 Plugin. It can be used to find linear paths for unit testing of any method. The linear path covers all the child methods and till leaf level of the hierarchy. The packages which should be covered in the path can be controlled.
-
24
swIMP (swig-based Interfaces for Mathematical Programming) provides Java wrappers for solvers written in C or C++. The current focus is on accessing OSI-compatible linear programming (LP) solvers from the Coin-OR-project (e.g. Clp, GLPK, MOSEK, CPLEX).
-
25
A simple program that solves linear equation systems. As of now only numerical coefficients are supported. The program is very simple and not suited for big matrices, since it uses laplace's method.
