Search Results for "problem a"
Sort By:
Showing 9 open source projects for "problem a"
View related business solutions-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
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.
-
1
Open Source Vizier
Python-based research interface for blackbox
...Defines abstractions and utilities for implementing new optimization algorithms for research and to be hosted in the service. A wide collection of objective functions and methods to benchmark and compare algorithms. Define a problem statement and study configuration. Setup a local server, setup a client to connect to the server, perform a typical tuning loop, and use other client APIs. -
2
Frevo
Frevo is probably the simplest tool for evolutionary design
FREVO is an open-source framework developed in Java to help engineers and scientists in evolutionary design or optimization tasks. The major feature of FREVO is the componentwise decomposition and separation of the key building blocks for each optimization tasks. We identify these as the problem definition, solution representation and the optimization method. This structure enables the components to be designed separately allowing the user to easily swap and evaluate different configurations and methods or to connect an external simulation tool. The latest version in development is hosted at https://github.com/smartgrids-aau/Frevo -
3
EasyCSP
Constraint Satisfaction Problem solving library for Java
EasyCSP is an open-source Java library for Constraint Satisfaction Programming. EasyCSP offers search algorithms for both CSPs and CSOPs. EasyCSP supports CSPs to be formalized using objects or int expressions. EasyCSP on GitHub: http://github.com/cordisvictor/easycsp-lib -
4
GMP Fortran library
Fortran binding for GMP library
Fortran binding for GMP library. Currently gfortran compiler supported on Linux and MS Windows (MinGW) platforms. Included Fortran program for solving Archimedes's cattle problem. -
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.
-
5
Python/FEniCS Examples
phase-field simulation and other examples with Python/FEniCS
The main goal of this project was developing phase-field simulations of lithium dendrite growth with FEniCS programmed in Python. The problem was based in the grand potential-based model of Zijian Hong and Venkatasubramanian Viswanathan (https://doi.org/10.1021/acsenergylett.8b01009) . Some simpler examples were developed before for a first approach with FEniCS: heat equation and combustion model. -
6
Bat2015
Bachelor of Science (Informatik)
The toolkit glpk supports methods for mixed integer linear programming (MILP). These methods solve Capital Budgeting Problems (CBP). Unfortunately, glpk does not support any multithreading and there is no feature to distribute problems via network connections. Today, this is a pitiable sight, because modern computer systems are coupled by networks and support multi threading. We create a distributed system with Apache thrift and the C-API of glpk. Now, it is possible to use as many cores in... -
7
MySQL DB Editor
MySQL Database Viewer, Editor
...Please note prerequisites for this program : - .Netframework 3.5 - WAMP server installed on your system ============================ ***PASSWORD - "itsfree" ============================ Please visit http://sourceforge.net/projects/va-database if, you have any problem or queries regarding how to use it. Your feedback is highly appreciated. Thank you! Publisher - Vinit Agrawal -
8
Pamvotis is a Wireless LAN Simulator for all the current physical layer extentions of the IEEE 802.11 (IEEE 802.11 a/b/g) standard and for the IEEE 802.11e Draft for Quality of Service in WLANs.
-
9
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 -
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
- Previous
- You're on page 1
- Next
