Java WSDL-based SOAP web service with Springboot (Spring-WS, Contract first) and nearest neighbor search
-
Updated
Sep 29, 2022 - Java
Java WSDL-based SOAP web service with Springboot (Spring-WS, Contract first) and nearest neighbor search
An Android library in Java for solving the Capacitated Vehicle Routing Problem (CVRP). Features include nearest neighbor algorithm for route optimization and efficient storage of distance matrices. Simplify CVRP implementation and enhance routing efficiency with DSM Solver.
Comparative Analysis of Solutions to the NP-hard Problem: Travelling Salesman Problem.
This is the third project for the course Data Structures at AUEB for the year 2019-2020.
Create a symbol table data type whose keys are two-dimensional points. Use a 2d-tree to support efficient range search and nearest neighbor search.
Connexion is a social media platform in its infancy. Users are matched based on personality type and common interests/hobbies.
Java implementation of an approximate nearest-neighbor search via space-filling curves
Weka package for KNN undersampling, based on code from https://github.com/marcelobeckmann/knnund
Fast Heuristics for Heterogeneous Vehicle Routing Problem with Simultaneous Pickup and Delivery
An API to find the best partner to deliver beverages to our customers, providing the best and fastest service. To achieve this our compute fleet deals with GIS objects all the time.
Attempt at solving the travelling salesman problem by implementing a 2 opt solution
ANN for Data Streams
Nearest Neighbor and Range Queries using 2d-trees.
Finding nearest city to a position in android using k-d trees
Closy is a library that provides fast and generic solutions for nearest neighbor search (NNS)
Small Java library to find the nearest neighbour of a k-dimensional set of points using an efficient k-d tree.
Nearest Neighbor Implementations for Java
This is a java application to find the nearest neighboring document using cosine similarity and euclidean distance
An efficient Nearest Neighbor Classifier for the MINST dataset. It uses a VP Tree data structure for preprocessing, thus improving query time complexity
Add a description, image, and links to the nearest-neighbor-search topic page so that developers can more easily learn about it.
To associate your repository with the nearest-neighbor-search topic, visit your repo's landing page and select "manage topics."