Search Results for "gpu-z" - Page 2
Sort By:
Showing 37 open source projects for "gpu-z"
View related business solutions-
Our Free Plans just got better! | Auth0 by OktaYou asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your secuirty. Auth0 now, thank yourself later.
-
Bright Data - All in One Platform for Proxies and Web ScrapingBright Data offers the highest quality proxies with automated session management, IP rotation, and advanced web unlocking technology. Enjoy reliable, fast performance with easy integration, a user-friendly dashboard, and enterprise-grade scaling. Powered by ethically-sourced residential IPs for seamless web scraping.
-
1
Java Decision Diagram Libraries (BDD)
Java Decision Diagrams (BDD) libraries: JDD and JBDD
This project has been moved to bitbucket.org: - https://bitbucket.org/vahidi/jbdd/wiki/Home - https://bitbucket.org/vahidi/jdd/wiki/Home It includes two libraries for working with decision diagrams: - JBDD: a Java interface to two popular BDD libraries, CUDD and BuDDy - JDD: a native Java library supporting BDD, Z-BDD -
2
A program for exploring complex functions, much like the now out-dated f(z). Domain colored plots of complex functions. Click evaluate. Uses reflection so you can code almost anything for your formula. All java. Please help.
-
3
A simple rendering, image processing engine. Includes a framework width (multiplatform) event handling, plugin management, a templated based math library and some exotic features like general linear camera, gpu based (OpenGL) image process...
-
4
Java package to study a clustering model described in the paper \"Novel Clustering Algorithm Based Upon Games on Evolving Network\" by Q. Li, Z. Chen, Y. He and J-P. Jiang (in arxiv: http://arxiv.org/pdf/0812.5064v1), generalizations and similar issues.
-
Top-Rated Free CRM SoftwareHubSpot is an AI-powered customer platform with all the software, integrations, and resources you need to connect your marketing, sales, and customer service. HubSpot's connected platform enables you to grow your business faster by focusing on what matters most: your customers.
-
5
Many computational problems need arithmetic operations in polynomial finite rings over Z/nZ, where n is an integer (n>1). This library provides efficient operations for applications such as integer factorization and primality testing.
-
6
This project implements several famous fractals, on GPU-Shaders. This enables the fractals to be calculated in real-time.
-
7
The project aims to provide the basic functions and algorithms needed for computations in polynomial rings over the ring of integers, including polynomial arithmetic and D-Groebner Bases. It might evolve in some kind of computer algebra system
-
8
GI-Gaia ist ein portables Framework zur Berechnung und Visualisierung verteilter Algorithmen (z. B. Bestimmung des größten gemeinsamen Teilers im Ring). Die konkreten Simulationen sind von den Basisdiensten getrennt und werden als Plugins nachgeladen.
-
9
FFFF is the fastest Win32/OSX/Linux/IRIX Mandelbrot generator. Features OpenGL, realtime zoom, SSE/AltiVec QuadPixel, SSE2/3DNow! DualPixel calc, FPU per pixel calc, GPU asm (Fragment/Vertex) calc, multiprocessor support, and benchmarking. Opt asm code!
-
Manage Properties Better For FreeInnago is a free and easy-to-use property management solution. Whether you have 1 unit or 1000, student housing, or commercial properties, Innago is built for you. Our software is designed to save you time and money, so you can spend more time doing the things that matter most.
-
10
A calculator that shows how it got its answer! It supports variables (X, Y, Z etc.) and many pre-defined constants such as Pi etc. It also has most if not all the functions of a Scientific calculator. It was coded in VB6 but was updated and is now VB.NE
-
11
PPAT, or Parallel Path following Algorithm using Triangles, is a reliable parallel tool to trace the level curves of any continuous, not necessarily smooth, function f(z): C → R.
-
12
We propose a novel algorithm for computing the number of ordered integer partitions with upper bounds. This problem's task is to compute the number of distributions of z balls into n urns with constrained capacities.