Download JAR files tagged by javapermutationtools with all dependencies
jpt from group org.cicirello (version 6.0.0)
JavaPermutationTools (JPT) is a library for
computation on permutations and sequences.
JPT provides Java classes that enable representing and
generating permutations and sequences, as well as
performing computation on permutations and sequences.
It includes implementations of a variety of permutation
distance metrics as well as distance metrics on sequences
(i.e., Strings, arrays, and other ordered data types).
Artifact jpt
Group org.cicirello
Version 6.0.0
Last update 25. July 2024
Organization Cicirello.Org
URL https://jpt.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 2
Dependencies rho-mu, core,
There are maybe transitive dependencies!
Group org.cicirello
Version 6.0.0
Last update 25. July 2024
Organization Cicirello.Org
URL https://jpt.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 2
Dependencies rho-mu, core,
There are maybe transitive dependencies!
jpt-examples from group org.cicirello (version 6.0.0)
This package contains several example programs of
the usage of the JavaPermutationTools (JPT) library. JPT is a Java
library that enables representing and generating permutations and
sequences, as well as performing computation on permutations and
sequences. It includes implementations of a variety of permutation
distance metrics as well as distance metrics on sequences (i.e.,
Strings, arrays, and other ordered data types). In addition to
programs demonstrating the usage of the JPT library, the
jpt-examples package also contains programs for replicating the
experiments from a few published papers that utilized the library
or implementations on which the library is based. JPT's source code
is maintained on GitHub, and the prebuilt jars of the library can
be imported from Maven Central using maven or other build tools.
The purpose of the package jpt-examples is to demonstrate usage of
the major functionality of the JPT library. You can find out
more about the JPT library itself from its
website: https://jpt.cicirello.org/.
0 downloads
Artifact jpt-examples
Group org.cicirello
Version 6.0.0
Last update 26. July 2024
Organization Cicirello.Org
URL https://github.com/cicirello/jpt-examples
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
Group org.cicirello
Version 6.0.0
Last update 26. July 2024
Organization Cicirello.Org
URL https://github.com/cicirello/jpt-examples
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
chips-n-salsa from group org.cicirello (version 7.0.1)
Chips-n-Salsa is a Java library of customizable,
hybridizable, iterative, parallel, stochastic, and self-adaptive
local search algorithms. The library includes implementations of
several stochastic local search algorithms, including simulated
annealing, hill climbers, as well as constructive search algorithms
such as stochastic sampling. Chips-n-Salsa now also includes genetic
algorithms as well as evolutionary algorithms more generally. The
library very extensively supports simulated annealing. It includes
several classes for representing solutions to a variety of optimization
problems. For example, the library includes a BitVector class that
implements vectors of bits, as well as classes for representing
solutions to problems where we are searching for an optimal vector
of integers or reals. For each of the built-in representations, the
library provides the most common mutation operators for generating
random neighbors of candidate solutions, as well as common crossover
operators for use with evolutionary algorithms. Additionally, the
library provides extensive support for permutation optimization
problems, including implementations of many different mutation
operators for permutations, and utilizing the efficiently implemented
Permutation class of the JavaPermutationTools (JPT) library.
Chips-n-Salsa is customizable, making extensive use of Java's generic
types, enabling using the library to optimize other types of representations
beyond what is provided in the library. It is hybridizable, providing
support for integrating multiple forms of local search (e.g., using a hill
climber on a solution generated by simulated annealing), creating hybrid
mutation operators (e.g., local search using multiple mutation operators),
as well as support for running more than one type of search for the same
problem concurrently using multiple threads as a form of algorithm portfolio.
Chips-n-Salsa is iterative, with support for multistart metaheuristics,
including implementations of several restart schedules for varying the run
lengths across the restarts. It also supports parallel execution of multiple
instances of the same, or different, stochastic local search algorithms for
an instance of a problem to accelerate the search process. The library
supports self-adaptive search in a variety of ways, such as including
implementations of adaptive annealing schedules for simulated annealing,
such as the Modified Lam schedule, implementations of the simpler annealing
schedules but which self-tune the initial temperature and other parameters,
and restart schedules that adapt to run length.
0 downloads
Artifact chips-n-salsa
Group org.cicirello
Version 7.0.1
Last update 12. December 2024
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 3
Dependencies jpt, rho-mu, core,
There are maybe transitive dependencies!
Group org.cicirello
Version 7.0.1
Last update 12. December 2024
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 3
Dependencies jpt, rho-mu, core,
There are maybe transitive dependencies!
Page 1 from 1 (items total 3)
© 2015 - 2024 Weber Informatics LLC | Privacy Policy