Search Results for "http c tiny" - Page 2
Sort By:
Showing 46 open source projects for "http c tiny"
View related business solutions-
Our Free Plans just got better! | Auth0You 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.
-
$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.
-
1
Matlab test to .NET C#
Open Source Code Simple Test of Microsoft .NET C# using NE Builder
FREE Download Open Source Code Simple Test of Microsoft .NET C# using MATLAB NE Builder Toolbox This is a simple demo of this powerful Matlab toolbox with some M script algo examples Download the ZIP package from http://quantlabs.net/blog/2012/11/free-download-open-source-code-simple-test-of-microsoft-net-c-using-matlab-ne-builder-toolbox-matlab-csharp/ -
2
Water Retention on Magic Squares Solver
Water Retention on Magic Squares with Constraint-Based Local Search
A Constraint-Based Local Search solver for the Water Retention on Magic Squares-problem. The problem is a very hard combinatorial optimisation problem, invented by Craig Knecht. More can be read about it at: http://en.wikipedia.org/wiki/Water_retention_on_mathematical_surfaces Craig's website for the problem: http://www.knechtmagicsquare.paulscomputing.com/ The solver is mainly based on the theory and ideas from my bachelor thesis, which I wrote at Uppsala University, Sweden, for the Astra Group which does research about Constraint Programming and related technologies: Water Retention on Magic Squares with Constraint-Based Local Search http://urn.kb.se/resolve?... -
3
Evolving Objects
This project have been merged within Paradiseo.
See the new project page: https://nojhan.github.io/paradiseo/ (Archived project page: http://eodev.sourceforge.net/) -
4
the c prototyping tools library provides thread-safe linked list, priority queue, hash table, hash list, AVL tree and trie implementations, as well as a thread pool and thread management framework, a tcp and http socket api, and a dbms abstraction layer.
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
5
...Most of the code from hoople1 has moved into the Feisty Meow® Concerns Ltd codebase, available at http://feistymeow.org for your enjoyment.
-
6
OsmSharp
OsmSharp - OpenStreetMap (OSM) Library and Tools developed in C#
*** this project has moved to codeplex: http://osmsharp.codeplex.com/ *** -
7
FM-index is a compressed text index appeared in 2000 (http://pizzachili.dcc.uchile.cl/indexes/FM-indexV2/). A recent algorithm allows to update a FM-index (http://dx.doi.org/10.1016/j.jda.2009.02.007). Here, you'll find the implementation.
-
8
http://www.open-source-soft.narod.ru/VoiceDetector.7z It voice detector class,for detecting human speech, anti noise, anti tones, standard C++, completely cross-platform by recompilation.
-
9
Boehm-Demers-Weiser Garbage Collector
Conservative "garbage collection" memory management library
The Boehm-Demers-Weiser conservative garbage collector. The CVS source of the version 7+ collector resided here for a while, but is now on github. Other information and release snapshots are currently at http://hboehm.info/gc -
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
10
Implementation of paralell partitioning algorithms achieving an optimal number of comparisons. See L. Frias and J. Petit. Parallel partition revisited. http://dx.doi.org/10.1007/978-3-540-68552-4_11 for further reference.
-
11
Fast cython implementation of trie data structure for Python. Development is inactive, but moved to: http://github.com/martinkozak/cytrie.
-
12
Implementation of Multikey Quickselect and new Multikey Quicksort variants in Frias L, Roura, S. Multikey Quickselect. Technical report LSI-09-27-R, Universitat Politècnica de Catalunya, 2009. http://www.lsi.upc.edu/dept/techreps/techreps.html.
-
13
Implementation of cache conscious STL lists in Frias, L., Petit, J., and Roura, S. 2009. Lists revisited: Cache-conscious STL lists. J. Exp. Algorithmics 14 (Dec. 2009), 3.5-3.27. DOI= http://doi.acm.org/10.1145/1498698.1564505
-
14
Very basic cellular automaton implementation in C#. Based upon the "Togetherness" algorithm described at http://www.hermetic.ch/pca/tg.htm.
-
15
-
16
The library currently consists of an implementation of collision detection of static/moving ellipsoids that exploits frame-coherence using separating planes. Please visit http://www.cs.hku.hk/GraphicsGroup/cd.html for paper references.
-
17
!!! The project has been renamed to "libanculus-sharp" and has been moved to googlecode : http://code.google.com/p/libanculus-sharp/ !!! LibCommon is a reusable library written in C#. It runs on Mono 1.2 or higher and .NET 2.0 or higher. It provides an
-
18
The PvtTable transforms a simple SQL consult into CrossTables not normalized. You can vary relationships between severals lines and columns more: http://en.wikipedia.org/wiki/Crosstab framework compatibility code 1.1Framework used 1.4
-
19
malkriz is solver for griddlers (japanese puzzle) written as simple portable classes in c++. You'll find here complete programs using it, written for MSVC6, Qt and cgi. Web version (in slovak language): http://frix.fri.utc.sk/~johny/mkfrm.php
-
20
aptimelib is a new, extremely portable, generic, 64-bit, time/date library. It implements the proposal by David R. Tribble ( http://david.tribble.com/text/c0xlongtime.html ), featuring epoch basis, microsecond granularity, and platform translation.
-
21
Path Partitioner
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 Variations using C# Generics http://www.codeproject.com/Articles/26050/Permutations-Combinations-and-Variations-using-C-G
