Beast code in Giters

An integrated humanoid control, planning and perception system. Developed by MIT and the University of Edinburgh for the Boston Dynamics Atlas and the NASA Valkyrie humanoid robots

Language:C++NOASSERTION11600

Blind-Image-Deblurring

Comparing Convex and Non-Convex Blind Image Deblurring Algorithms

Language:MATLAB300

crystal-face

Garmin Connect IQ watch face

Language:Monkey CGPL-3.036700

RectangleBinPack

Source code for performing 2d rectangular bin packing.

Language:C++86200

GRASPPROPT

A C++ application for solving cooperative ground vehicle and unmanned aerial vehicle routing problems using greedy randomized adaptive search procedure with path relinking algorithm.

Language:C++500

Ipopt

COIN-OR Interior Point Optimizer IPOPT

Language:C++NOASSERTION136400

TSP-TabuSearch

Solve Travelling salesman problem using tabu search

Language:C++Apache-2.01300

gde

Generic Dijkstra Example

Language:C++BSL-1.0300

dijkstra

Generic Dijkstra implementation

Language:C++BSL-1.0100

Cost-Constrainted-Shortest-Paths

Imagine the following situation. You are planning a trip across the country (from start city s to destination city d). Your degrees of freedom in selecting a particular path are captured in a graph where vertices represent locations (cities, towns, arbitrary latitude/longitude coordinates) and edges represent \links" between locations { e.g., you might be able to take a bus from vertex u to vertes v. Unlike the traditional shortest paths problem solved by, for example, Dijkstra's algorithm (where each edge (u; v) has a single weight w(u; v), each edge (u; v) in our problem has two weights: * a non-negative integer cost c and * a non-negative integer traversal time t.

Language:C++100