Free carnival cruise lines software for linux

Console Lines is a "Lines" game for the Unix terminal. There is no in-game help available right now, so check the README file. To move the cursor, use arrows (or jkhl), to select or to move a chip, use space. To instantly quit, use q. Console Lines requires a certain terminal size, supports a mouse (curses or GPM), and works with various ncurses libraries.
You will need an ANSI standart C compiler, GNU make, and a decent curses library that supports colors.
The current lists of operation systems tested:
Linux, glibc 2.2
Solaris 9
OpenBSD 3.8
CygWin 5
Enhancements:
- Support for smaller terminals (as small as 19x19).
- Support for terminal resize.
- Support for black and white terminals.
- Support for command line options.
- A workaround for a nasty ALTLinux/Debian GPM bug.
- Persistant high scores.
- A man page has been added.

Kreski-Lines is a collection of icons for Gnome theme.

Approximator Line is an application which allows to synthesize approximation function of one argument. Both coordinates of known points or mathematical expression can be used as input data.
The application uses evolutionary algorithm which allows to find more optimal results. The enhanced evolutionary algorithm allows to avoid long-time hitting to local maximum.
In few hours the application can evaluate milliards of combinations with using of reasonable number of input data points and on contemporary computer. Approximator Line uses multithreading that can help to utilize maximum computation power.
Approximator Lines primary goal is to search of function, which value, most come nearer to the initial data. The preference is given the smallest functions. The weight of this preference is established in options of synthesis.
Search of function is made by the next way:
The random mathematical variant is under construction. Its fitness to the data is calculated. Further the variant is copied and changes. Fitness of the changed variant is calculated. If it is more, the new variant becomes base. It is simplified.
Key parameter of the found function is fitness of its set goal. Fitness is expressed in percentage. Its value depends on a way of the assignment of fitness of a point (it is established in parameters of synthesis). The program uses two basic such as fitness:
General fitness
Calculates on the general points.
Additional fitness
Calculates on general and additional points. It is used for more exact definition of fitness. It also is used for avoidance of a finding of such functions which correspond to the basic points, but in an interval between them strongly differ.
Additional fitness is used for a finding of the most corresponding functions at smaller amount of computing expenses as it calculates only if the basic fitness more than at the previous variant. Besides each of the mentioned above fitness can be normal or effective.
Normal fitness
Fitness in view of amount of elements of expression.
Effective fitness
Fitness without taking into account amount of elements of expression.
In the list of results normal additional conformity and effective additional conformity is accordingly displayed.
By search of the most suitable variant, or in other words synthesis cancelation constant subexprassions is made also.
Synthesis is based on use of random numbers. Functions making expression, operators variables and numbers get out randomly. The application is optimized on speed. So synthesized function in memory represents a tree of mathematical objects. Values of function are calculates by the most effective way. The mutation also is made above a tree of objects.
Usage:
- Determine the form of the input data (coordinates or expression).
- Choose points of your graph. Synthesis will be estimated on them.
- Enter coordinates of points (use autonumbering for simplification of input) or expression.
- Determine a range of value of function, amount of the basic points, amount of additional points.
- Open parameters of synthesis and adjust if it is necessary.
- Save the project.
- Press Start of synthesis.
- Pass to results and see on them.
- Leave the application working on long time.
- Periodically check results. When the application will find, in your opinion, suitable function, press Stop and save results.

Enemy lines 7 is a single player first person 3d shooter game.

Shoot down enemy bombers threatening your city.

Algorithm::SixDegrees is a Perl module that can find a path through linked elements in a set.

SYNOPSIS

use Algorithm::SixDegrees;

my $sd1 = Algorithm::SixDegrees->new();
$sd1->data_source( actors => &starred_in );
$sd1->data_source( movies => &stars_of );
@elems = $sd1->make_link(actors, Tom Cruise, Kevin Bacon);

my $sd2 = Algorithm::SixDegrees->new();
$sd2->forward_data_source( friends => &friends, @args );
$sd2->reverse_data_source( friends => &friend_of, @args );
@elems = $sd2->make_link(friends, Bob, Mark);

Algorithm::SixDegrees is a Perl implementation of a breadth-first search through a set of linked elements in order to find the shortest possible chain linking two specific elements together.

In simpler terms, this module will take a bunch of related items and attempt to find a relationship between two of them. It looks for the shortest (and generally, simplest) relationship it can find.

KDM-Lines is a KDM theme to go with http://www.kde-look.org/content/show.php?content=53167

I hope this is what you had in mind.

Orakle is an oracle for the desktop to ease choices.

It works similar to the Magic 8 Ball Konfabulator widget.

Dont get too much addicted.

TODO:
* add more answers
* 2/3 lines per text
- maybe resize the theme