devarsh13 Goto Github PK

awesome-public-datasets

An awesome list of high-quality open datasets in public domains (on-going).

course3

datasharing

The Leek group guide to data sharing

efficient-routing-for-multicast-and-broadcast

exdata_plotting1

Plotting Assignment 1 for Exploratory Data Analysis

forwardtacotron

⏩ Generating speech in a single forward pass without any attention!

gambit

Gambit

parallel-travelling-salesman-problem

The ​ Travelling Salesman Problem​ (often called ​ TSP​ ) is a classic algorithmic problem in the field of computer science. It is focused on optimization. In this context ​ better solution ​ often means ​ a solution that is cheaper ​ . TSP is a mathematical problem. It is most easily expressed as a graph describing the locations of a set of nodes. TSP can be modelled as an undirected weighted graph, such that cities are the graph's vertices, paths are the graph's edges, and a path's distance is the edge's length. It is a minimization problem starting and finishing at a specified vertex after having visited each other vertex exactly once We will be considering Symmetric Travelling Salesman Problem in which the the distance between two cities is the same in each opposite direction, forming an undirected graph.

pcbre

An integrated printed circuit board reverse engineering toolkit

plagiarism-checker

programmingassignment2

Repository for Programming Assignment 2 for R Programming on Coursera

repdata_peerassessment1

Peer Assessment 1 for Reproducible Research

sns