Download JAR files tagged by bounds with all dependencies
funcish-clojure from group org.funcish (version 0.1.0)
0 downloads
Artifact funcish-clojure
Group org.funcish
Version 0.1.0
Last update 25. July 2013
Organization not specified
URL Not specified
License not specified
Dependencies amount 2
Dependencies funcish-core, clojure,
There are maybe transitive dependencies!
Group org.funcish
Version 0.1.0
Last update 25. July 2013
Organization not specified
URL Not specified
License not specified
Dependencies amount 2
Dependencies funcish-core, clojure,
There are maybe transitive dependencies!
funcish-core from group org.funcish (version 0.1.0)
0 downloads
Artifact funcish-core
Group org.funcish
Version 0.1.0
Last update 25. July 2013
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group org.funcish
Version 0.1.0
Last update 25. July 2013
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
funcish-parent from group org.funcish (version 0.1.0)
Functional programming API borrowing heavily from Ruby and Clojure but staying within the bounds of Java
Group: org.funcish Artifact: funcish-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 funcish-parent
Group org.funcish
Version 0.1.0
Last update 25. July 2013
Organization not specified
URL http://www.funcish.org/
License BSD
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group org.funcish
Version 0.1.0
Last update 25. July 2013
Organization not specified
URL http://www.funcish.org/
License BSD
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
pmptt from group one.edee.oss (version 1.2.2)
Library encapsulates a special flavour of MPTT algorithm with predictable bound computation logic,
that allows to minimize write overhead that is otherwise closely connected to standard MPTT algorithm.
MPTT flattens hierarchical structure to flat structure with bounds that allow quick filtering children
or parent nodes when required.
Group: one.edee.oss Artifact: pmptt
Show all versions
Show all versions
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact pmptt
Group one.edee.oss
Version 1.2.2
Last update 24. June 2022
Organization FG Forrest, a.s.
URL https://github.com/FgForrest/PMPTT/
License MIT License
Dependencies amount 3
Dependencies jsr305, commons-logging, lombok,
There are maybe transitive dependencies!
Group one.edee.oss
Version 1.2.2
Last update 24. June 2022
Organization FG Forrest, a.s.
URL https://github.com/FgForrest/PMPTT/
License MIT License
Dependencies amount 3
Dependencies jsr305, commons-logging, lombok,
There are maybe transitive dependencies!
pmptt_core from group one.edee.oss (version 1.2.2)
0 downloads
Artifact pmptt_core
Group one.edee.oss
Version 1.2.2
Last update 24. June 2022
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group one.edee.oss
Version 1.2.2
Last update 24. June 2022
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
pmptt_rdbms from group one.edee.oss (version 1.2.2)
0 downloads
Artifact pmptt_rdbms
Group one.edee.oss
Version 1.2.2
Last update 24. June 2022
Organization not specified
URL Not specified
License not specified
Dependencies amount 6
Dependencies darwin, pmptt_core, spring-core, spring-context, spring-jdbc, spring-tx,
There are maybe transitive dependencies!
Group one.edee.oss
Version 1.2.2
Last update 24. June 2022
Organization not specified
URL Not specified
License not specified
Dependencies amount 6
Dependencies darwin, pmptt_core, spring-core, spring-context, spring-jdbc, spring-tx,
There are maybe transitive dependencies!
pmptt_tests from group one.edee.oss (version 1.2.2)
Artifact pmptt_tests
Group one.edee.oss
Version 1.2.2
Last update 24. June 2022
Organization not specified
URL Not specified
License not specified
Dependencies amount 2
Dependencies pmptt_core, pmptt_rdbms,
There are maybe transitive dependencies!
Group one.edee.oss
Version 1.2.2
Last update 24. June 2022
Organization not specified
URL Not specified
License not specified
Dependencies amount 2
Dependencies pmptt_core, pmptt_rdbms,
There are maybe transitive dependencies!
discodnc from group de.tum.ei.lkn.eces (version 2.4.3-lkn)
Deterministic Network Calculus (DNC) is a methodology for worst-case modeling and analysis of communication networks. It enables to derive deterministic bounds on a server’s backlog as well as a flow’s end-to-end delay. Given a directed graph of servers (server graph) and the flows crossing these servers, the Disco Deterministic Network Calculator (DiscoDNC) automates the derivation of bounds.
Artifact discodnc
Group de.tum.ei.lkn.eces
Version 2.4.3-lkn
Last update 03. January 2021
Organization not specified
URL discodnc.cs.uni-kl.de
License GNU General Lesser Public License (LGPL) version 2.1
Dependencies amount 1
Dependencies commons-math3,
There are maybe transitive dependencies!
Group de.tum.ei.lkn.eces
Version 2.4.3-lkn
Last update 03. January 2021
Organization not specified
URL discodnc.cs.uni-kl.de
License GNU General Lesser Public License (LGPL) version 2.1
Dependencies amount 1
Dependencies commons-math3,
There are maybe transitive dependencies!
hyperPipes from group nz.ac.waikato.cms.weka (version 1.0.2)
Class implementing a HyperPipe classifier. For each category a HyperPipe is constructed that contains all points of that category (essentially records the attribute bounds observed for each category). Test instances are classified according to the category that "most contains the instance".
Does not handle numeric class, or missing values in test cases. Extremely simple algorithm, but has the advantage of being extremely fast, and works quite well when you have "smegloads" of attributes.
1 downloads
Artifact hyperPipes
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/hyperPipes
License GNU General Public License 3
Dependencies amount 1
Dependencies weka-dev,
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/hyperPipes
License GNU General Public License 3
Dependencies amount 1
Dependencies weka-dev,
There are maybe transitive dependencies!
winnow from group nz.ac.waikato.cms.weka (version 1.0.2)
Implements Winnow and Balanced Winnow algorithms by Littlestone. For more information, see N. Littlestone (1988). Learning quickly when irrelevant attributes are abound: A new linear threshold algorithm. Machine Learning. 2:285-318; N. Littlestone (1989). Mistake bounds and logarithmic linear-threshold learning algorithms. University of California, Santa Cruz. Does classification for problems with nominal attributes (which it converts into binary attributes)
1 downloads
Artifact winnow
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/winnow
License GNU General Public License 3
Dependencies amount 1
Dependencies weka-dev,
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/winnow
License GNU General Public License 3
Dependencies amount 1
Dependencies weka-dev,
There are maybe transitive dependencies!
Page 3 from 4 (items total 33)