Search Results for "problem a"
Sort By:
Showing 37 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.
-
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.
-
1
AcoPath for Java
Ant Colony Optimization algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of the Ant System is that virtual ants are exploited for finding paths with a specific property, e.g., short distance between physical nodes, in the same way nature guides physical ants. -
2
commit-autosuggestions
A tool that AI automatically recommends commit messages
...CodeBERT: A Pre-Trained Model for Programming and Natural Languages introduces a pre-trained model in a combination of Program Language and Natural Language(PL-NL). It also introduces the problem of converting code into natural language (Code Documentation Generation). We can use CodeBERT to create a model that generates a commit message when code is added. However, most code changes are not made only by add of the code, and some parts of the code are deleted. We plan to slowly conquer languages that are not currently supported. ... -
3
BoostMultiDex
Load multiple dex files on low Android version devices
BoostMultiDex is a specialized Android-library created by ByteDance to address a long-standing performance and user-experience problem on older Android devices (specifically Android 4.x and below, i.e. SDK < 21), where loading multiple dex files after installation or upgrade can lead to extremely long “black-screen” freeze times during first startup. Instead of relying on the standard Android MultiDex mechanism, BoostMultiDex reworks the loading strategy by tapping into hidden Dalvik VM internals so that original DEX bytecode can be loaded directly, bypassing costly ODEX generation. ... -
4
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known... -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
DGRLVQ
Dynamic Generalized Relevance Learning Vector Quantization
...If a prototype, for some reasons, is ‘outside’ the cluster which it should represent and if there are points of a different categories in between, then the other points act as a barrier and the prototype will not find its optimum position during training. Since the model complexity is not known in many cases, we avoid this problem by introducing a "Dynamic" version of LVQ. Dynamic-GRLVQ (DGRLVQ), which adapts the model complexity to the given problem during training by adding or removing prototypes dynamically/realtime one by one for each category until satisfactory classification results are achieved. -
6
Genetic Oversampling Weka Plugin
A Weka Plugin that uses a Genetic Algorithm for Data Oversampling
Weka genetic algorithm filter plugin to generate synthetic instances. This Weka Plugin implementation uses a Genetic Algorithm to create new synthetic instances to solve the imbalanced dataset problem. See my master thesis available for download, for further details. -
7
jalicanto
Traveling Salesman Problem "window time based" aproximate solver
Time based Traveling salesman problem solver. Using iterated local search algorithm, implements xkick perturbation Programmed in Java. A class to use the TSP Suite(Thomas Weise, Raymond Chiong, J ¨org L¨assig, Ke Tang, Shigeyoshi Tsutsui, Wenxiang Chen, Zbigniew Michalewicz, Xin Yao, Benchmarking Optimization Algorithms: An Open Source Framework for the Traveling Salesman Problem. 2014.),is implemented. -
8
This site contains four packages of Mass and mass-based density estimation. 1. The first package is about the basic mass estimation (including one-dimensional mass estimation and Half-Space Tree based multi-dimensional mass estimation). This packages contains the necessary codes to run on MATLAB. 2. The second package includes source and object files of DEMass-DBSCAN to be used with the WEKA system. 3. The third package DEMassBayes includes the source and object files of a Bayesian...
-
9
SoMaTePs
Solver for Math Text Problems
The Word Problem Solver is a program that is able to solve math word problems like they are teached in the first four classes in primary school. Currenty the program is restricted to math word problems that are presented in german language. -
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.
-
10
Stella
Elementary Arithmetic Word Problem Solver
Basic natural language processor capable of solving elementary math word problems such as: 1) John has 7 pencils. He buys 10 more pencils. How many pencils does he have in all? 2) There are 6 boys and 4 girls in a library. How many kids are there altogether? 3) Bob ran 8 miles and Stella ran 2 miles. How many miles did they run altogether? 4) What is the sum of 7 and 2? 5) What is 8 divided by 2? 6) What is the 10 subtracted by 2? 7) What is 2 subtracted from 10? Also shows users... -
11
FJSP Software
A Software for Flexible Job Shop Scheduling
Flexible job shop scheduling problem (FJSP) is very important in many fields such as production management, resource allocation and combinatorial optimization. In the real manufacturing systems, each operation could be processed on more than one machine and each machine can also process several operations. This feature is known as flexibility. You can define your problem in this software and get an optimal solution as a Gantt Chart. -
12
TreeLiker
TreeLiker is a collection of fast algorithms for working with complex
...The algorithms included in TreeLiker are unique in that, in principle, they are able to search given sets of relational patterns exhaustively, thus guaranteeing that if some good pattern capturing an important feature of the problem exists, it will be found. In experiments with real-life data, the algorithms were shown to be able to construct complete non-redundant sets of patterns for chemical datasets involving several thousands of molecules as well as for comparably large datasets from genomics or proteomics. The included relational learning algorithms are tailored towards so-called tree-like features for which some otherwise very hard sub-problems (NP-hard) become tractable. -
13
...Current targets are GO board game and Texas Holdem poker. It investigates Genetic programming to build game AI logic. Also EA/GP simulations for TSP, Graph layout and Prisoners Dilemma problem.
-
14
EGA
A novel and effictive GA algorithm to solve optimization problem
Classical genetic algorithm suffers heavy pressure of fitness evaluation for time-consuming optimization problems. To address this problem, we present an efficient genetic algorithm by the combination with clustering methods. The high efficiency of the proposed method results from the fitness estimation and the schema discovery of partial individuals in current population and. Specifically, the clustering method used in this paper is affinity propagation. The numerical experiments demonstrate that the proposed method performs promisingly for well-known benchmark problems in the term of optimization accuracy. -
15
HSSVM(Hyper-Sphere Support Vector Machines) is a software for solving multi-classification problem, implemented by Java.
-
16
Justhink is a framework for develop artificial intelligence simulations. The Framework provides a simulation software and an API to develop external modules that are plugged into simulation, such as the problem/mission and artificial intelligence modules
-
17
Awakener aims to provide a Java library for solving practical, real world optimisation problems by means of genetic algorithms (turnkey algorithms for >= 90% of industry problems). Awakener extends Sleepwalker with specific algorithms.
-
18
Sleepwalker aims to provide a highly abstract, universal, reusable, extensible Java-based genetic algorithms framework which can be used as a basis for modelling and programming virtually any practical optimisation problem.
-
19
SwarmTSP is a library of swarm intelligence algorithms for the Traveling Salesman Problem. Currently, it implements Ant Colony Optimization and Consultant-Guided Search algorithms.
-
20
SwarmQAP is a Java library of swarm intelligence algorithms for the Quadratic Assignment Problem. Currently, it implements Tabu Search, MAX-MIN Ant System and Consultant-Guided Search algorithms.
-
21
backprop1 provides a simple three layer backpropagation neural network implemented in java. There are three demo programs to perform point classification, the XOR problem and character recognition.
-
22
GAAF is a tool for analyzing Genetic Algorithms (GA for short). It allows to check the behavior of a particular GA resolving a particular problem so one can get empirical information to decide which GA best fits problem's conditions.
-
23
Cutting Problem solved by Genetic algorithms. The goal is to cut a rectangular plate of material into more smaller rectangles. The cuts must be rectangular and guillotinable.
-
24
An academic project where computer-science students can practice data structures principles. Based on the famous problem of the labyrinth rat, this application has an engine where you can run your own algorithms to help the robot to get out of the laby.
-
25
The CommGen platform is intended to be a simple, scalable integration platform for small to medium problem sets. The architecture is simple, consisting of a distributed kernel, distributed O/S, agent and application layer.
