Download JAR files tagged by parallel with all dependencies
com.ibm.batch-tck-spi from group com.ibm.batch (version 1.0-b05)
Group: com.ibm.batch Artifact: com.ibm.batch-tck-spi
Show all versions Show documentation Show source
Show all versions Show documentation Show source
0 downloads
Artifact com.ibm.batch-tck-spi
Group com.ibm.batch
Version 1.0-b05
Last update 15. February 2013
Organization not specified
URL Not specified
License not specified
Dependencies amount 1
Dependencies javax.batch-api,
There are maybe transitive dependencies!
Group com.ibm.batch
Version 1.0-b05
Last update 15. February 2013
Organization not specified
URL Not specified
License not specified
Dependencies amount 1
Dependencies javax.batch-api,
There are maybe transitive dependencies!
com.ibm.batch-model from group com.ibm.batch (version 1.0-b05)
0 downloads
Artifact com.ibm.batch-model
Group com.ibm.batch
Version 1.0-b05
Last update 15. February 2013
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group com.ibm.batch
Version 1.0-b05
Last update 15. February 2013
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
com.ibm.batch-cdi-integration from group com.ibm.batch (version 1.0-b04)
Group: com.ibm.batch Artifact: com.ibm.batch-cdi-integration
Show all versions Show documentation Show source
Show all versions Show documentation Show source
0 downloads
Artifact com.ibm.batch-cdi-integration
Group com.ibm.batch
Version 1.0-b04
Last update 31. January 2013
Organization not specified
URL Not specified
License not specified
Dependencies amount 3
Dependencies com.ibm.batch-runtime, javax.batch-annotation, javax.batch-api,
There are maybe transitive dependencies!
Group com.ibm.batch
Version 1.0-b04
Last update 31. January 2013
Organization not specified
URL Not specified
License not specified
Dependencies amount 3
Dependencies com.ibm.batch-runtime, javax.batch-annotation, javax.batch-api,
There are maybe transitive dependencies!
com.ibm.batch-annotation-processors from group com.ibm.batch (version 1.0-b03)
Group: com.ibm.batch Artifact: com.ibm.batch-annotation-processors
Show all versions Show documentation Show source
Show all versions Show documentation Show source
0 downloads
Artifact com.ibm.batch-annotation-processors
Group com.ibm.batch
Version 1.0-b03
Last update 11. January 2013
Organization not specified
URL Not specified
License not specified
Dependencies amount 1
Dependencies javax.batch-annotation,
There are maybe transitive dependencies!
Group com.ibm.batch
Version 1.0-b03
Last update 11. January 2013
Organization not specified
URL Not specified
License not specified
Dependencies amount 1
Dependencies javax.batch-annotation,
There are maybe transitive dependencies!
jung-parent from group io.github.devlibx.jung (version 3.1)
JUNG the Java Universal Network/Graph Framework--is a software
library that provides a common and extensible language for the
modeling, analysis, and visualization of data that can be
represented as a graph or network. It is written in Java, which
allows JUNG-based applications to make use of the extensive
built-in capabilities of the Java API, as well as those of other
existing third-party Java libraries. The JUNG architecture is
designed to support a variety of representations of entities and
their relations, such as directed and undirected graphs,
multi-modal graphs, graphs with parallel edges, and hypergraphs.
It provides a mechanism for annotating graphs, entities, and
relations with metadata. This facilitates the creation of
analytic tools for complex data sets that can examine the
relations between entities as well as the metadata attached to
each entity and relation. The current distribution of JUNG
includes implementations of a number of algorithms from graph
theory, data mining, and social network analysis, such as
routines for clustering, decomposition, optimization, random
graph generation, statistical analysis, and calculation of
network distances, flows, and importance measures (centrality,
PageRank, HITS, etc.). JUNG also provides a visualization
framework that makes it easy to construct tools for the
interactive exploration of network data. Users can use one of
the layout algorithms provided, or use the framework to create
their own custom layouts. In addition, filtering mechanisms are
provided which allow users to focus their attention, or their
algorithms, on specific portions of the graph.
Group: io.github.devlibx.jung Artifact: jung-parent
Show all versions
Show all versions
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact jung-parent
Group io.github.devlibx.jung
Version 3.1
Last update 22. April 2021
Organization not specified
URL http://devlibx.github.io/jung/
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group io.github.devlibx.jung
Version 3.1
Last update 22. April 2021
Organization not specified
URL http://devlibx.github.io/jung/
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
jung-parent from group com.northdata.jung (version 2.2.0)
JUNG the Java Universal Network/Graph Framework--is a software
library that provides a common and extendible language for the
modeling, analysis, and visualization of data that can be
represented as a graph or network. It is written in Java, which
allows JUNG-based applications to make use of the extensive
built-in capabilities of the Java API, as well as those of other
existing third-party Java libraries. The JUNG architecture is
designed to support a variety of representations of entities and
their relations, such as directed and undirected graphs,
multi-modal graphs, graphs with parallel edges, and hypergraphs.
It provides a mechanism for annotating graphs, entities, and
relations with metadata. This facilitates the creation of
analytic tools for complex data sets that can examine the
relations between entities as well as the metadata attached to
each entity and relation. The current distribution of JUNG
includes implementations of a number of algorithms from graph
theory, data mining, and social network analysis, such as
routines for clustering, decomposition, optimization, random
graph generation, statistical analysis, and calculation of
network distances, flows, and importance measures (centrality,
PageRank, HITS, etc.). JUNG also provides a visualization
framework that makes it easy to construct tools for the
interactive exploration of network data. Users can use one of
the layout algorithms provided, or use the framework to create
their own custom layouts. In addition, filtering mechanisms are
provided which allow users to focus their attention, or their
algorithms, on specific portions of the graph.
Group: com.northdata.jung Artifact: jung-parent
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact jung-parent
Group com.northdata.jung
Version 2.2.0
Last update 18. September 2020
Organization not specified
URL http://jrtom.github.io/jung/
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group com.northdata.jung
Version 2.2.0
Last update 18. September 2020
Organization not specified
URL http://jrtom.github.io/jung/
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
jung-parent from group net.sf.jung (version 2.1.1)
JUNG the Java Universal Network/Graph Framework--is a software
library that provides a common and extendible language for the
modeling, analysis, and visualization of data that can be
represented as a graph or network. It is written in Java, which
allows JUNG-based applications to make use of the extensive
built-in capabilities of the Java API, as well as those of other
existing third-party Java libraries. The JUNG architecture is
designed to support a variety of representations of entities and
their relations, such as directed and undirected graphs,
multi-modal graphs, graphs with parallel edges, and hypergraphs.
It provides a mechanism for annotating graphs, entities, and
relations with metadata. This facilitates the creation of
analytic tools for complex data sets that can examine the
relations between entities as well as the metadata attached to
each entity and relation. The current distribution of JUNG
includes implementations of a number of algorithms from graph
theory, data mining, and social network analysis, such as
routines for clustering, decomposition, optimization, random
graph generation, statistical analysis, and calculation of
network distances, flows, and importance measures (centrality,
PageRank, HITS, etc.). JUNG also provides a visualization
framework that makes it easy to construct tools for the
interactive exploration of network data. Users can use one of
the layout algorithms provided, or use the framework to create
their own custom layouts. In addition, filtering mechanisms are
provided which allow users to focus their attention, or their
algorithms, on specific portions of the graph.
Group: net.sf.jung Artifact: jung-parent
Show all versions
Show all versions
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact jung-parent
Group net.sf.jung
Version 2.1.1
Last update 07. September 2016
Organization not specified
URL http://jrtom.github.io/jung/
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group net.sf.jung
Version 2.1.1
Last update 07. September 2016
Organization not specified
URL http://jrtom.github.io/jung/
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
raceSearch from group nz.ac.waikato.cms.weka (version 1.0.2)
Races the cross validation error of competing attribute subsets. Use in conjuction with a ClassifierSubsetEval. RaceSearch has four modes:
forward selection races all single attribute additions to a base set (initially no attributes), selects the winner to become the new base set and then iterates until there is no improvement over the base set.
Backward elimination is similar but the initial base set has all attributes included and races all single attribute deletions.
Schemata search is a bit different. Each iteration a series of races are run in parallel. Each race in a set determines whether a particular attribute should be included or not---ie the race is between the attribute being "in" or "out". The other attributes for this race are included or excluded randomly at each point in the evaluation. As soon as one race has a clear winner (ie it has been decided whether a particular attribute should be inor not) then the next set of races begins, using the result of the winning race from the previous iteration as new base set.
Rank race first ranks the attributes using an attribute evaluator and then races the ranking. The race includes no attributes, the top ranked attribute, the top two attributes, the top three attributes, etc.
It is also possible to generate a raked list of attributes through the forward racing process. If generateRanking is set to true then a complete forward race will be run---that is, racing continues until all attributes have been selected. The order that they are added in determines a complete ranking of all the attributes.
Racing uses paired and unpaired t-tests on cross-validation errors of competing subsets. When there is a significant difference between the means of the errors of two competing subsets then the poorer of the two can be eliminated from the race. Similarly, if there is no significant difference between the mean errors of two competing subsets and they are within some threshold of each other, then one can be eliminated from the race.
0 downloads
Artifact raceSearch
Group nz.ac.waikato.cms.weka
Version 1.0.2
Last update 26. April 2012
Organization University of Waikato, Hamilton, NZ
URL http://weka.sourceforge.net/doc.packages/raceSearch
License GNU General Public License 3
Dependencies amount 2
Dependencies weka-dev, classifierBasedAttributeSelection,
There are maybe transitive dependencies!
Group nz.ac.waikato.cms.weka
Version 1.0.2
Last update 26. April 2012
Organization University of Waikato, Hamilton, NZ
URL http://weka.sourceforge.net/doc.packages/raceSearch
License GNU General Public License 3
Dependencies amount 2
Dependencies weka-dev, classifierBasedAttributeSelection,
There are maybe transitive dependencies!
jung2 from group net.sf.jung (version 2.0.1)
JUNG the Java Universal Network/Graph Framework--is a software
library that provides a common and extendible language for the
modeling, analysis, and visualization of data that can be
represented as a graph or network. It is written in Java, which
allows JUNG-based applications to make use of the extensive
built-in capabilities of the Java API, as well as those of other
existing third-party Java libraries. The JUNG architecture is
designed to support a variety of representations of entities and
their relations, such as directed and undirected graphs,
multi-modal graphs, graphs with parallel edges, and hypergraphs.
It provides a mechanism for annotating graphs, entities, and
relations with metadata. This facilitates the creation of
analytic tools for complex data sets that can examine the
relations between entities as well as the metadata attached to
each entity and relation. The current distribution of JUNG
includes implementations of a number of algorithms from graph
theory, data mining, and social network analysis, such as
routines for clustering, decomposition, optimization, random
graph generation, statistical analysis, and calculation of
network distances, flows, and importance measures (centrality,
PageRank, HITS, etc.). JUNG also provides a visualization
framework that makes it easy to construct tools for the
interactive exploration of network data. Users can use one of
the layout algorithms provided, or use the framework to create
their own custom layouts. In addition, filtering mechanisms are
provided which allow users to focus their attention, or their
algorithms, on specific portions of the graph.
Group: net.sf.jung Artifact: jung2
Show all versions
Show all versions
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact jung2
Group net.sf.jung
Version 2.0.1
Last update 24. January 2010
Organization not specified
URL http://jung.sourceforge.net/site
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group net.sf.jung
Version 2.0.1
Last update 24. January 2010
Organization not specified
URL http://jung.sourceforge.net/site
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
chips-n-salsa from group org.cicirello (version 7.0.0)
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.0
Last update 01. August 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.0
Last update 01. August 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 39 from 39 (items total 390)