[AAAI 2021] Code release for "Bi-Classifier Determinacy Maximization for Unsupervised Domain Adaptation" https://arxiv.org/abs/2012.06995
-
Updated
Dec 15, 2020 - Python
[AAAI 2021] Code release for "Bi-Classifier Determinacy Maximization for Unsupervised Domain Adaptation" https://arxiv.org/abs/2012.06995
Unsupervised learning coupled with applied factor analysis to the five-factor model (FFM), a taxonomy for personality traits used to describe the human personality and psyche, via descriptors of common language and not on neuropsychological experiments. Used kmeans clustering and feature scaling (min-max normalization).
Official implementation of On-Demand Sampling: Learning Optimally from Multiple Distributions (Neurips 2022)
Robust optimization and projected extragradient for synthetic fulfillment-center labor planning under workload uncertainty.
Chess AI written in Rust that uses the min/max algorithm and tree pruning so predict 5-6 moves ahead.
CNF Encodings for the Min-Max Multiple Traveling Salesmen Problem
Robust optimization and saddle-point methods for synthetic middle-mile transportation capacity planning under demand uncertainty.
A min-max Tetris AI that acts as a wrapper for a tkinter implementation of Tetris, which I also made
It is crucial in today’s last-mile delivery ecosystem to optimize for speed, and cost efficiencies. Smarter algorithms play a crucial role in the ecommerce marketplace deliveries. We need to group/batch the delivery of multiple items to the same rider without losing time. Implemented using rule based and clustering algorithm.
To associate your repository with the min-max-optimization topic, visit your repo's landing page and select "manage topics."