Книга "Архитектура сложных веб-приложений. С примерами на Laravel"

Detecting robot grasping positions with deep neural networks. The model is trained on Cornell Grasping Dataset. This is an implementation mainly based on the paper 'Real-Time Grasp Detection Using Convolutional Neural Networks' from Redmon and Angelova.

An implementation of our RA-L work 'Real-world Multi-object, Multi-grasp Detection'

A curated list of awesome grasping libraries and resources

Robotic grasp dataset for multi-object multi-grasp evaluation with RGB-D data. This dataset is annotated using the same protocal as Cornell Dataset, and can be used as multi-object extension of Cornell Dataset.

RCM is a simple CRM application designed for Auto Parts Store made with ASP.NET Core based on DDD, CQRS and SOLID Principles.

A Python package with a collection of algorithms for the (Resource) Constrained Shortest Path problem

a simple Matlab gui for annotating rotated grasping bounding box

A grasp simulation environment in gazebo: UR robot arm with a 85mm robotiq gripper that can be drived to grasp things through moveit

🌱 Genetic Algorithm, Memetic Algorithms, GRASP, Simulated Annealing, Multi start search, Reiterated Local Search, Local Search, Greedy and randomized Greedy

This Repository is for simulating a simple grasping behaviour using visual feedback

Tutorial on DDD (Domain-Driven Design), by building a Web App with the theme "Personal Finance Management". Adapted from a group project in university.

Source code for the evaluated benchmarks and proposed cache management technique, GRASP, in [Faldu et al., HPCA'20].

This is my implementation of a branch and price algorithm to solve the humanitarian aid distribution problem. This problem is a VRP with a specific objective function

Scripts to generate and process point clouds in YCB dataset.

Run our ROS kinetic environment including the workspace and projects

Metaheuristic problems

Underactuated Finger for Proprioceptive Tactile Sensing

Practica 1 de metaheuristica

This repository was created for the subject of Computer Theory. The propose of this subject is to improve your skills to solve the 0-1 knapsack problem of different ways. The techniques used were Dynamic Programing and two metaheuristics (which are GRASP and TABU search).

🐍 Snakes and Ladders game done to study GRASP

A group Placement and Training Project

Project repository for a solution of the "Walking Bus Challenge" of the Foundations of Operations Research course of M.Sc. Computer Science and Engineering at Politecnico di Milano.

Collection of heuristic and metaheuristic algorithms

Solving SOP with SA, GRASP, Tabu Search algorithms. Include an analytic report.

User interface and solver to a metaheuristics problem.

A GRASP algorithm for the Quota Traveling Salesman Problem

Source code for the evaluated benchmarks and proposed cache management technique, GRASP, in [Faldu et al., HPCA'20].

FiveA is a heuristic algorithm to solve the one-dimensional cut problem.

Timetabling solver for higher education institutions