Results 17,761–17,770 of 19,819 for %22HTTP Server%22.(0.012 seconds)
Previous
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
Next
The Stanford GraphBase: A Platform for Combinatorial Computing
A workbench for combinatorial computing, and standard sets of data that
can be used for benchmark tests of competing methods by Donald Knuth.
Also includes demonstration programs and games that make use of the data.
Gerald Pfeifer <gerald@FreeBSD.org>
This module is required to build Perl RPM packages
rpm-build-perl is required to build Perl RPM packages;
it contains scripts for automatic dependency tracking,
RPM macros for Perl.
Symbolic Model Verifier System for checking finite state systems
The SMV (Symbolic Model Verifier) system is a tool for
checking finite state systems against specifications
in the temporal logic CTL (Computational Tree Logic).
One specifies the finite state system (finite automaton,
Mealy machine, full adder circuit, ..) as a Kripke
structure in the SMV language and provides specifications
in CTL. The model checking algorithm allows to determine
if the Kripke structure fulfills the specifications.
Driver based class to calculate holidays in Austria
Driver based class to calculate holidays in Austria.
Driver based class to calculate holidays in Brazil
Driver based class to calculate holidays in Brazil.
Driver based class to calculate holidays in Denmark
Driver based class to calculate holidays in Denmark.
Driver based class to calculate Discordian holidays
Driver based class to calculate Discordian holidays.
Driver based class to calculate holidays in England and Wales
Driver based class to calculate holidays in England and Wales.
Driver based class to calculate holidays in Germany
Driver based class to calculate holidays in Germany.
Driver based class to calculate holidays in Iceland
Driver based class to calculate holidays in Iceland.