Search Results for "open solver"
Sort By:
Showing 9 open source projects for "open solver"
View related business solutions-
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.
-
Cut Data Warehouse Costs by 54%BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
1
Alignment Solver
Solve Alignment of Road , Rail,Tunnel
Alignment solver is now part of SurveyTools. You can find tha latest version at https://sourceforge.net/projects/surveytools/ Alignment solver is a utility to solve alignment of Road, Rail or Tunnel. It can handle horizontal and vertical offset alignment , offset in transitions. cant, Import form LANDxml and other formats , exports to Landxml, GSI , Trimble ascii , Inroads ascii etc. The project is under Heavy development. Please report any issues to the ticket system. Tested... -
2
Burn To The Brim
Utility for efficiently grouping files and folders together
**Burn To The Brim** is a highly efficient archiving utility designed to solve the classic subset-sum (bin packing) optimization challenge. It intelligently selects and groups files and directories (documents, high-fidelity media, or raw back-ups) to optimally fill recordable Blu-Rays, USB drives or custom-capacity storage drives. By recursively scanning your designated folders, BTTB matches item sizes to your media capacity, finding a near-perfect selection in milliseconds and an... -
3
Binary Analysis Platform
Binary Analysis Platform
The Carnegie Mellon University Binary Analysis Platform (CMU BAP) is a suite of utilities and libraries that enables analysis of programs in the machine code representation. BAP supports x86, x86-64, ARM, MIPS, PowerPC and new architectures can be added as plugins. BAP includes various analyses, standard interpreter, microexecution interpreter, and symbolic executor. BAP features its own domain-specific language, Primus Lisp, that is used for implementing analyses, specifying verification... -
4
Triton
Triton is a dynamic binary analysis library
Triton is a dynamic binary analysis library. It provides internal components that allow you to build your program analysis tools, automate reverse engineering, perform software verification or just emulate code. Linux, Windows and OS X compatible. You can directly compile source code from our Github repository. The Triton library is Linux, Windows and OS X compatible. A potential way to getting started is to see our Python examples already bootstrapped. -
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
5
dep-trace
gdeptrace dependancy solver correct for pkg or make deps
gdeptrace sorts an input dependancy list or table and prints it, and can do other actions. It's default operation is to act like tsort (1) except that it sorts by pure pkg / make dependancy (tsort sorts by grapical topology: see notes about differences). EXAMPLE: $ echo -e "b e\ne\nc b" | sort -k1,1 | gdeptrace [opts] e b c (b depends on e, c depends on b, e has no depends) (also: e has more items depending on it and is below anything it depends on; in this case... -
6
DisChoco
DisChoco: Distributed Constraint Reasoning Solver
DisChoco is a Distributed Constraint Reasoning Solver. Several Distributed Constraint Reasoning algorithms are implemented (like ABT, AFC, Adopt, ...). Users may easily implement and test their algorithms with DisChoco. contact: wahbi[at]users[dot]sourceforge[dot]net -
7
JBernstein
JBernstein: Exploration techniques for non-linear constraint checking
JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance,... -
8
Pydusa is a package for parallel programming using Python. It contains a module for doing MPI programming in Python. We have added parallel solver packages such as Parallel SuperLU for solving sparse linear systems.
-
9
HOMB is a simple benchmark based on a parallel iterative Laplace solver aimed at comparing the performance of MPI, OpenMP, and hybrid codes on SMP and multi-core based machines.
-
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
- Previous
- You're on page 1
- Next