21 packages returned for Tags:"Research"

Tobii Pro .NET SDK. Used for developing applications for the Tobii Pro line of eye trackers. You need at least one eye tracker to make use of this SDK.

Tobii Pro .NET SDK. Used for developing applications for the Tobii Pro line of eye trackers. You need at least one eye tracker to make use of this SDK.

ParquetSharp is a .NET library for reading and writing Parquet files. It's implemented in C# as a PInvoke wrapper around apache-parquet-cpp to provide high performance and compatibility.

Async C# Client for the CoinPaprika API

Provides the core problem solver abstraction for use with Google OR-tools Constraint Solver and Linear Solver wrappers.

Format your .net object to be displayed on web. There is also a little web research tool, but not very efficient.

C# .NET Integration with Peanut Labs social monetization ( http://www.peanutlabs.com ) Samples in ASP.NET MVC and ASP.NET Webforms included

A C#-based system-level design framework with VHDL output

Type equalities for F#. These equalities allow us to create type-safe abstractions by allowing us to encode Generalised Algebraic Data Types (GADTs), as found in languages like Haskell.

Format your .net object to be displayed on web. There is also a little web research tool, but not very efficient. This is the graphic part in winforms

Format your .net object to be displayed on web. There is also a little web research tool, but not very efficient.

Codes research tools

This library is deprecated in favor of Fed.Fred and will receive no more updates.

A .Net library for interacting with the Federal Reserve Economic Data (FRED) API. This is a free package. If this project helps you reduce time to develop, please make a donation via our project page. It encourages us to keep making the package better and more efficient. Thank you.

F# library for dealing with value types with the specific goal of writing allocation free F# code

C#-only solver for the rectangular linear assignment problem, also known as the minimum weight full matching problem for bipartite graphs. The algorithm is based on shortest augmenting path search.

Provides Protocol Buffer Parser and Listener assets which build a subset of the Abstract Syntax Tree (AST) Descriptors.

Provides the Protocol Buffer Abstract Syntax Tree (AST) Descriptors. Note that we only furnish a subset of the AST for purposes of what we are doing.

Provides a convenient, easy to use wrapper for Constraint Satisfaction Programming based on the Google OR-tools.

Provides a convenient, easy to use wrapper for Constraint Satisfaction Programming based on the Google OR-tools.