Search Results for "graph c#" - Page 6
Sort By:
Showing 133 open source projects for "graph c#"
View related business solutions-
Over two-thirds of people reuse passwords across sites, resulting in an increasingly insecure e-commerce ecosystem. Learn how passwordless can not only mitigate these issues but make the authentication experience delightful. Implement Auth0 in any application in just five minutes
-
SKUDONET ADC, operates at the application layer, efficiently distributing network load and application load across multiple servers. This not only enhances the performance of your application but also ensures that your web servers can handle more traffic seamlessly.
-
1
The Graph Implementation and Representation Libraries, or GIRLs, aim to be all-purpose libraries for solving graph theory problems. ie, shortest paths, matching, cycles, connectedness, creating 'random' graphs, etc...
-
2
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.)
-
3
This software will allow users to create graph of any kind. The user could apply some algo on the graph, like : Warshall, Ford Bellman, etc... These algo would be use with the help of the Boost library.
-
4
-
Email is the backbone of your customer engagement. The Twilio SendGrid Email API is the email service trusted by developers and marketers for time-savings, scalability, and delivery expertise. Our flexible Email API and proprietary Mail Transfer Agent (MTA), intuitive console, powerful features, and email experts make it easy to ensure all your email gets delivered in seconds and without interruption.
-
5
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... -
6
Yasa is yet another simulated annealing. Using this metaheuristic we determine near optimal schedules for a given task graph. As this is computationally intensive, we use the pvm library to allow parallel computations on workstation clusters.
-
7
This is a project to create a compiler that converts grammars written in SRGS standard (http://www.w3.org/TR/speech-grammar/) to a graph understandable by HMM based ASR engines. Check srgs-parser.sf.net
-
8
MetriVis is a client/server toolkit developed at the ETH Zurich. It's main purpose is to plot Netflow data (network flow information) on a webclient using an xy graph. It may be used to visualize any xy data. It has a Google-Maps style user interface.