Weighted Interval Scheduling, the classic Dynamic Programming problem implemented in Java
-
Updated
May 28, 2017 - Java
Weighted Interval Scheduling, the classic Dynamic Programming problem implemented in Java
Simplified weighted sum algorithm implementation used on Mealou (https://m.me/Mealoubot | http://www.mealou.co)
Data and code for the experiments in: "Measuring Thematic Fit with Distributional Feature Overlap". Enrico Santus, Emmanuele Chersoni, Alessandro Lenci and Philippe Blache. EMNLP 2017
A graph toolkit made with Java
Kruskal's Algorithm (greedy) to find a Minimum Spanning Tree on a graph
Calculate the Volume-Weighted Average Price (VWAP)
Population weighted spatial stratified sampling.
Data and code for the experiments in the Outlier Detection task proposed by Camacho-Collados et al.
The problem of Weighted Job Scheduling considers a set of jobs. Each job has a start time, a finish time and a profit. The goal is to find a subset of jobs with the maximum profit such that no two jobs in the subset overlap. My solution uses Dynamic Programming.
The code for Weighted Fisher Discriminant Analysis (WFDA) and Kernel WFDA
Very fast C# class for weighted random picking.
# Project - Weighted and undirected graph model - very fast and accurate. Using Hashmaps. 11/2020
This is a script that defines a class for training a neural network using a genetic algorithm. You will have to score it yourself (because of the nature of genetic algorithms), but otherwise it works well. The methods included are slice and random crossover, as well as top 2 and weighted pick for the selection method.
Using weighted average formula, profit and loss is calculated in Bank Nifty Data of 5 min
Add a description, image, and links to the weighted topic page so that developers can more easily learn about it.
To associate your repository with the weighted topic, visit your repo's landing page and select "manage topics."