Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.
Launch 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.
Start Free Trial
Earn up to 16% annual interest with Nexo.
Let your crypto work for you
Put idle assets to work with competitive interest rates, borrow without selling, and trade with precision. All in one platform.
Geographic restrictions, eligibility, and terms apply.
A .Net Library that lets you make full use of multi-core and multiprocessor computers. It is very efficient, and easily integrated into existing applications. It is modeled after the Parallel FX usage model, and is faster than the PFX too.
A minimalistic CASE tool that will allow end-users to analyze their graphs (plain-old graphs, UML diagrams, ERDs, etc.) by applying various graph theory functions to them (such as a shortest path algorithm or a spanning tree algorithm.)
MAML (MathML for XAML) is a framework providing an extension to XAML's object model to allow using MathML declarative syntax directly in XAML. The framework includes controls for rendering and WYSIWYG editing of mathematical notation.
With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You 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 security. Auth0 now, thank yourself later.
Numerikus is an attempt to build a set of numerical libraries written in C/C++, Fortran, Java and C# for single processor and multi-core processors. It wil have from basic functions to Linear Algebra solvers and ODE's and PDE's methods.
Finds bad examples for the local search Path Partitioning algorithm
Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf.
Requirements:
Microsoft Automatic Graph Layout
http://research.microsoft.com/en-us/projects/msagl/
Gurobi Optimizer
http://www.gurobi.com/
Permutations, Combinations, and...
This is a Windows Mobile software for embedded devices.
It's meant to measure time in a countdown style.
When time is up it plays an alarm.wav sound found in the same program's directory.
It uses the .NET Compact Framework 3.5 for mobile devices.