Ports Search

Results 14,03114,040 of 19,819 for %22HTTP Server%22.(0.011 seconds)
mail/xcite-1.60 (Score: 9.2878623E-4)
Exciting Cite for any Mail/News reading modes on Emacs
This package enables you to registe as many mail/news citation prefix as you like according to each author, and to select those headers randomly.
mail/thunderbird-dictionaries-20060220 (Score: 9.2878623E-4)
Dictionaries for Mozilla Thunderbird
Localized Dictionaries for Mozilla Thunderbird
math/trader-0.3.0 (Score: 9.2878623E-4)
Trader extension based on TA-Lib
The trader extension is a free open source stock library based on TA-Lib. It's dedicated to trading software developers requiring to perform technical analysis of financial market data. Alongside many indicators like ADX, MACD, RSI, Stochastic, TRIX the candlestick pattern recognition and several vector arithmetic and algebraic functions are present.
math/mvtnorm-0.9.96 (Score: 9.2878623E-4)
Multivariate Normal and t Distributions
R-cran-mvtnorm computes multivariate normal and t probabilities, quantiles, random deviates and densities.
math/zarith-1.2.1 (Score: 9.2878623E-4)
OCaml arithmetic library for arbitrary precision integers
The Zarith library implements arithmetic and logical operations over arbitrary precision numbers. It uses GMP to efficiently implement arithmetic over large numbers. Small integers are represented as Caml unboxed integers for speed and space economy.
math/memisc-0.99.7.1 (Score: 9.2878623E-4)
Provides an infrastructure for the management of survey data
One of the aims of this package is to make life easier for useRs who deal with survey data sets. It provides an infrastructure for the management of survey data including value labels, definable missing values, recoding of variables, production of code books, and import of (subsets of) SPSS and Stata files. Further, it provides functionality to produce tables and data frames of arbitrary descriptive statistics and (almost) publication-ready tables of regression model estimates. Also some convenience tools for graphics, programming, and simulation are provided.
math/minqa-1.2.4 (Score: 9.2878623E-4)
Derivative-free optimization algorithms by quadratic approximation
Derivative-free optimization by quadratic approximation based on an interface to Fortran implementations by M. J. D. Powell.
math/libjbigi-0.8.7 (Score: 9.2878623E-4)
i2p JNI to GNU MP Bignum library (libgmp)
[ excerpt from developer's web site ] Using JNI (Java Native Interface), a bit of C code (thanks ugha!), a little manual work and a piece of chewinggum: it is possible to make the public key cryptography quite a bit faster.
math/zoo-1.7.13 (Score: 9.2878623E-4)
S3 Infrastructure for Regular and Irregular Time Series
An S3 class with methods for totally ordered indexed observations. It is particularly aimed at irregular time series of numeric vectors/matrices and factors. zoo's key design goals are independence of a particular index/date/time class and consistency with ts and base R by providing methods to extend standard generics.
math/abacus-3.2.b1 (Score: 9.2878623E-4)
Branch-And-CUt System
ABACUS is a software system written in C++ that provides a framework for the implementation of branch-and-bound algorithms using linear programming relaxations. Cutting planes or columns can be generated dynamically (branch-and-cut, branch-and-price, branch-and-cut-and-price). ABACUS allows the software developer to concentrate merely on the problem specific parts, i.e., the separation of cutting planes, column generation, and primal heuristics. ABACUS supports the Open Solver Interface (Osi) developed by the COIN-OR (COmputational INfrastructure for Operations Research) project which means that every solver supported by OSI can be used to solve the relaxations. Moreover, ABACUS provides a variety of general algorithmic concepts, e.g., a list of different enumeration and branching strategies from which the best alternative for the user's application can be chosen. Finally, ABACUS provides many basic data structures and useful tools for the implementation of such algorithms. It is designed both for general mixed integer optimization problems and for combinatorial optimization problems. It unifies cutting plane and column generation within one algorithm framework. Simple reuse of code and the design of abstract data structures and algorithms are met by object oriented programming modules.