Skip to content
View andresrodriv's full-sized avatar

Block or report andresrodriv

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse

Popular repositories Loading

  1. Internet-of-Things-Project-Smart-Thermostat Internet-of-Things-Project-Smart-Thermostat Public

    The topology used in this project consists in the creation of 5 sky motes; The first one, rpl-border-router, included in the examples folder of Contiki 2.7, is already working for our purposes. The…

    C 2

  2. IP-lookup-B-Prefix-length-algorithm IP-lookup-B-Prefix-length-algorithm Public

    The goal of the project is the implementation of two IP algorithms, binary trie and binary search on prefix length, in order to perform address lookup using them and studying their performances in …

    Python

  3. Implementing-an-n-class-priority-scheduling-for-a-M-M-1-queue-with-and-without-preemption Implementing-an-n-class-priority-scheduling-for-a-M-M-1-queue-with-and-without-preemption Public

    Project for the traffic theory curse at POlitecnico di MIlano, developed in omnet++

    C++

  4. Crowd-counter-through-sniffing-Wi-Fi-packets Crowd-counter-through-sniffing-Wi-Fi-packets Public

    Python

  5. Adaptive-Beamforming Adaptive-Beamforming Public

    Project developed with the collaboration of Gianpaolo Alessiani and Givanni Vacirca for the course of Wireless Communications at Politecnico di Milano

    MATLAB 3

  6. ILP-and-Heuristic-for-a-Bin-Packin-problem-with-3-capacitys ILP-and-Heuristic-for-a-Bin-Packin-problem-with-3-capacitys Public

    This project was developed with the collaboration of Francesco Lateano and Gianpaolo Alessiani for the course of Graph Optimization at Politecnico di Milano

    AMPL