C++ & Java implementations of 6 algorithm problems — tromino tiling, knight's tour, Tower of Hanoi (4-peg), knight swap, target shooting, and lattice coverage — using Divide & Conquer, Greedy, BFS, ...
Abstract: Knapsack problem is a classical optimization problem in computer science and programming. Knapsack problem main objective is to solve how much the maximum profit can be carried with the ...
Graph Edit Distance optimized with Greedy Algorithm for Similarity Search in Business Process Graphs
Abstract: Business process is a way to create work system in a company or institution. Business process make delegation of work distributed well suitable based on work location. It is also important ...
The Dynamic Vehicle Routing Problem with Stochastic Requests (DVRPSR) is a prototypical problem in transportation logistics. The DVRPSR calls for an initial route plan and an online scheduling policy ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results