Search Results for "search engine optimization"

ntuacarlo: library of open-source implementation of optimization algorithms for Matlab/GNU Octave The library implements matlab functions for the following optimization algorithms: Simulated Annealing Particle Swarm Optimization Monte Carlo Exhaustive search The signature of the functions follow the same as the ga() function of Matlab. All the functions support lower and upper bounds, linear and non-linear constraints, and integer variables.Octave

...DOWNLOAD LATEST VERSION OF TXM : http://textometrie.ens-lyon.fr/spip.php?rubrique61&lang=en TXM offers a comprehensive range of analysis tools (concordances, collocate search, frequency lists, etc.) based on the powerfull CQP full text search engine (http://cwb.sourceforge.net) and a range of statistical functions (factorial analysis, classification, cooccurrency analysis, etc.) based on R packages (http://www.r-project.org). Read the scientific background at the Textométrie project web site http://textometrie.ens-lyon.fr/?...

NOMAD is a C++ code that implements the MADS algorithm (Mesh Adaptive Direct Search) for difficult blackbox optimization problems. Such problems occur when the functions to optimize are costly computer simulations with no derivatives.

popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known network flow and other graph algorithms. ...

Hrothgar is a parallel minimizer and Markov Chain Monte Carlo generator by Andisheh Mahdavi of San Francisco State University. It has been used to solve optimization problems in astrophysics (galaxy cluster mass profiles) as well as in experimental particle physics (hadronic tau decays). It is probably adaptable enough to be applied to your merit function if you can write it in C.

A simple interface for performing genetic algorithm optimization for numerical problems. I am starting with a stripped-down version, where a solution can be described using a single vector of float numbers. Eventually, I will expand to more generic data structures and add multiple-species search options. For the time being, I have no plans of developing a GUI. For now, this is strictly a computational module.

Highly tunable, simple to use collection of the templates, containing a set of classes for solving unconstrained large scale nonlinear optimization problems. Currently it contains: -- Limited Memory Quasi Newton (L-BFSG) -- BFSG -- Conjugate Gradient -- Gradient Descent -- Wolf condition Line Search -- Backtracking Line Search -- Exact Golden Search -- Golden Search with Wolf condition We also distribute a set of tests with the library.

.... --- Highlights: --- org.knowceans.util: IndexQuickSort, TableList: apply order of one array/list to others +++ Vectors, ArrayUtils: array convenience +++ RandomSamplers, CokusRandom, ArmSampler, Densities: random sampling and distributions +++ Arguments: command line parser +++ StopWatch, Which, ExternalProcess: runtime stuff +++ ParallelFor: OpenMP workalike +++ PatternString, NamedGroupRegex: regex convenience --- org.knowceans.corpus: CorpusSearcher: full-text search engine +++ LabelNumCorpus: svmlight corpus storage and filtering +++ NIPS corpus with text, authors, labels and citations --- org.knowceans.map: InvertibleHashMultiMap, BijectiveHashMap: implement n:m and 1:1 relations. --- Other libs: knowceans-arms = port of the Adaptive Rejection Metropolis Sampler (ARMS) for arbitrary distributions +++ lda-j = port of lda-c, implementing Latent Dirichlet Allocation (LDA)

The Kyoto FST Decoder is a general decoding engine for Weighted Finite State Transducers. It features flexible XML-based configuration, beam-search decoding, and is able to output separate weights for weight tuning.

SURIKATA (Syntactic Universal Reasoning for Inducing Kolmogorov Abstract Theories Automatically) is a system for searching large spaces of artifacts and inducing algorithms for generating similar artifacts.

The Simple Interface for Global Optimization Algorithms allows the specification of arbitrary search/optimization problems, solving of these problems, and the specification and implementation of optimization algorithms like evolutionary algorithms.

A web-based, automated search engine that responds to user feedback through the use of artificial intelligence.