Aix 5l Problem Determination
Aix en Provence - petit futé - guide - voyage v.1.0.0.0
Petit Futé propose ses premières applications interactives de villes françaises avec toujours la même devise : « Les bonnes adresses du bout de la rue au bout du monde ! » Il s’agit ici d’une application ON LINE et l’application
Travelling Salesman problem in the city v.1.1.0.0
Let's imagine for an example such situation.
JNIWrapper for IBM AIX (ppc32) v.3.10
JNIWrapper library allows to interface native code while retaining full control of the application on the Java side. With JNIWrapper, there is no need to create native libraries to call a function of the operating system API or a library function.
Hourglass Problem
In this game you are given 2 hourglasses one of 7 minutes and the other of 11 minutes. Your task is to use these 2 hourglasses to measure times of 15 minutes and 24 minutes. Can you do that?
Monty Hall Problem v.1.2.0.0
Simulates a game similar to the finale of the TV game show Let's Make a Deal. You are shown three doors and select one. The host, Monty Hall, then shows you one of the doors contains a goat.
On-Tap PLUS AIX AIX v.X
On-Tap Plus lets you print bar codes from any application on any printer.
Puzzled - Logic Problem Solver v.1.3
This java program will ultimately solve grid-type logic problems if given enough clues in a pseudo english language.
Robot4 v.6.11
Robot4 (tm) is a Robotic Arm Movement program where the arm is moved from given position to desired position(an Inverse Problem). The program finds the angles necessary for the desired position. Improved Productivity demo do to Calculus programming
Edraw MindMap v.6.6
Easy to create mind maps (graphical representations of thought processes) for brainstorming, problem solving, rational analysis, and decision marking.
Performance Navigator v.15.0
Performance Navigator® is a graphical PC Tool for IBM i (all iSeries®) Performance Management, Capacity Planning and Problem Solving which runs on Windows® 95/98/NT/2000/XP/Windows 7.
Category Discrimination and Reasoning v.1.0
There are 3 steps for each problem. In the 1st step, a list of words is presented in which all but one belong to the same category and the user must identify the one word that does not belong.