Graphing Ellipse Problem

Modern day Windows computers are very complex but unfortunately far from perfect. Over time with the installation and removal of games, programs, software and hardware your computer can experience windows problems. Windows problems can make your computer perform very slowly. This can be on... Platforms: Windows

Optimization Algorithm Toolkit is a workbench and toolkit for developing, evaluating, and playing with classical and state-of-the-art optimization algorithms on standard benchmark problem domains; including reference algorithm implementations, graphing, visualizations and much more. The project... Platforms: *nix

Computer History Graphing Project is a computer family tree. The Computer History Graphing Project is an attempt to graph every computer standard, every piece of hardware, every OS, and every computer language in one big family tree.. Platforms: *nix

Regular Expression Graphing Program project is a regular expression graphing program. This program is designed to take a regular expression and produce a graph of the state machine that is used to parse the regular expression. It is useful for teaching regular expressions and state machines.... Platforms: *nix

Graphing Calculator Viewer allows you to view and interact with Graphing Calculator documents. It includes examples and demonstrations of the software.It features:2D curves3D surfacesInequalitiesSave moviesSave for Web saves HTML & PNG filesSave as RTF export to word processorsActs as a web... Platforms: Mac

The Jonker-Volgenant algorithm is much faster than the famous Hungarian algorithm for the Linear Assignment Problem (LAP). This Matlab implementation is modified from the original C++ code made by Roy Jonker, one of the inventors of the algorithm. It is about 10 times faster than the munkres code... Platforms: Matlab

This is a fast non-iterative ellipse fit, and among fast non-iterative ellipse fits this is the most accurate and robust.It takes the xy-coordinates of data points, and returns the coefficients of the equation of the ellipse: ax^2 + bxy + cy^2 + dx + ey + f = 0,i.e. it returns the vector... Platforms: Matlab

This is a fast and non-iterative ellipse fit. Usage: A = EllipseDirectFit(XY)Input: XY(n,2) is the array of coordinates of n points x(i)=XY(i,1), y(i)=XY(i,2) Output: A = [a b c d e f]' is the vector of coefficients of the equation of the best fitting ellipse: ax^2 + bxy + cy^2 + dx + ey + f =... Platforms: Matlab

A Lambert-orbital boundary value problem can be stated as"Find the orbit/trajectory of a spacecraft that flies from position [r1] to [r2], taking a time [tf] and making [m] complete orbits before arriving at [r2]. "The solution to each Lambert-problem is NOT unique; one can travel to [r2] via the... Platforms: Matlab

This is a program that generates a test problem for linear optimization with a sparse matrix. The test problem is of the kindmin c'*xs.t. Aeq*x=beq lb Platforms: Matlab

RECORDS is a FREE, multi-user, problem oriented, database and word processing report writer, optimized for data entry using voice recognition, and designed for medical care. Enter and maintain clients and their demographics, create new or update past problems of a client, edit multiple... Platforms: Windows

Records is a FREE, multi-user, problem oriented, word processor and database, designed for medical care. It is optimized for data entry using a speech recognition system, like Dragon. Enter clients and their demographics, multiple problems for a client, sectioned descriptions of each problem, and... Platforms: Windows

FGT, the Flexible Graphing Tool is a cgi for producing statistics based on any data-set. It is intended to be used for summarised data, taking up far less space than the original logs. Platforms: Windows, Mac, Linux

A Java workbench and toolkit for developing, evaluating, and playing with classical and state-of-the-art optimization algorithms on standard benchmark problem domains; including reference algorithm implementations, graphing, visualizations and much more. Platforms: Windows, Mac, Linux

simulatedannealing() is an optimization routine for traveling salesman problem. Any dataset from the TSPLIB can be suitably modified and can be used with this routine. A detailed description about the function is included in "Simulated_Annealing_Support_Document.pdf."A GUI is used with the core... Platforms: Matlab

This function contains the well known greedy algorithm for solving Set Cover problem (ChvdodAtal, 1979), with two small modifications:* In case of more than one possible choice at a certain step, the biggest set is chosen;* Once the solution is found, we check the selected sets to find a better... Platforms: Matlab

With this package, I provide some MATLAB-functions regarding the rectangular assignment problem. This problem appears for example in tracking applications, where one has M existing tracks and N new measurements. For each possible assignment, a cost or distance is computed. All cost values form a... Platforms: Matlab

This is an application of the Greedy Algorithm and the Local Search for finding a solution for the SC Distribution Network problem.We dealt with one level SC composed of a set of factories and a set of Sales Points, each sales point has a demand at a certain time, each factory has a production... Platforms: Matlab

Analysis and simulation of orbits in the circular-restricted three-body problem (CRTBP), where primary and secondary bodies move in circular orbits about the common center of mass, and effect of gravitational attraction of the smallest body are ignored. The applications described here are for... Platforms: Matlab

Finds a (near) optimal solution to a variation of the M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to individual cities and back to the original starting place).Each salesman starts at the first point, and... Platforms: Matlab