Professional set of Delphi and C++Builder components for virtual instrumentation

  • Meters, Bars (Gauge), with linear or log(10) scaling
  • Digital indicators (time, value)
  • Operating Point display
  • Dial (knob), Sliders, Trend/Recorder
  • buttons, switches, LED indicators
  • DB-Aware components and many more

By Remi Cormier.

Freeware 18 Mar 2002

Description

ELFIN2 is a simple Finite Element Code, limited to: 2D problem, linear elasticity, static. Three solving options are avalaible: Axisymetric, plane stress and plane strain. It has been used to slove problems up to 3000 nods (6000 degre of freedom), on a 700 MHz and 384 MB RAM machine (6 hours).

Informations

  • Status: Fully functional
  • Source: None
  • Size: 421kB

Platforms: NT4, W98,

By Kostia Chekotun.

Commercial 28 Aug 2004

Description

This program solves the planar (Euclidean) Traveling Salesman Problem (TSP). The heuristic algorithm provides seemingly good solution. Full version includes: This application with file input/output enabled. DLL containing the algorithm. VCL component (with source) that wraps DLL. Source code of an …

Informations

  • Status: Demo only
  • Source: On request
  • price: $250
  • Size: 248kB

Platforms: W2K, W2K3, W95, W98, XP,

By Max Zabalov.

Shareware 05 Aug 1999

Description

This program can draw diagrams of functions and derivatives of functions. Very easy for use. Have a lot of standart functions. Recommended for schoolboys and girls, students, teachers and other peoples.

Informations

  • Status: Partially restricted
  • Source: None
  • price: $15
  • Size: 741kB

Platforms: W95, W98,

By Troels Jakobsen.

Freeware + source 12 Oct 2001

Description

The classic travelling salesman problem, solved via a genetic algorithm (a heuristic algorithm related to artificial life).

Informations

  • Status: Fully functional
  • Source: Included
  • Size: 201kB

Platforms: NT4, W2K, W95, W98,

By GrMikeD.

Freeware + source 24 Jan 2000

Description

TSP Solver is a program that solves the famous Travelling Salesman Problem (TSP) of the graph theory. It gives you the option of using the Heuristic or the Exhaustive algorithm, it calculates the optimal cost and measures the time and the flop of the algorithm. It also creates graphs of the results …

Informations

  • Status: Fully functional
  • Source: Included
  • Size: 415kB

Platforms: NT4, W95, W98,