cid results from the CPAN

version or of any later version published by the Free Software
Foundation.  If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.

  If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.

  Later license versions may give you additional or different

view all matches for this distribution

Aion-Run

1 match

version or of any later version published by the Free Software
Foundation.  If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.

  If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.

  Later license versions may give you additional or different

view all matches for this distribution

Aion-Spirit

1 match

version or of any later version published by the Free Software
Foundation.  If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.

  If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.

  Later license versions may give you additional or different

view all matches for this distribution

Aion-Surf

1 match

version or of any later version published by the Free Software
Foundation.  If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.

  If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.

  Later license versions may give you additional or different

view all matches for this distribution

Aion-Telemetry

1 match

version or of any later version published by the Free Software
Foundation.  If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.

  If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.

  Later license versions may give you additional or different

view all matches for this distribution

Algorithm-AM

8 results

lib/Algorithm/AM.pm view on Meta::CPAN

        $self->{context_size}
    );
    return $result;
}

# since we split the lattice in four, we have to decide which features
# go where. Given the number of features being used, return an arrayref
# containing the number of features to be used in each of the the four
# lattices.
sub _compute_lattice_sizes {
    my ($num_feats) = @_;

view all matches for this distribution

Algorithm-AdaBoost

2 results

use File::Path ();

use vars qw{$VERSION $MAIN};
BEGIN {
	# All Module::Install core packages now require synchronised versions.
	# This will be used to ensure we don't accidentally load old or
	# different versions of modules.
	# This is not enforced yet, but will be some time in the next few
	# releases once we can make sure it won't clash with custom
	# Module::Install extensions.
	$VERSION = '1.06';

view all matches for this distribution

Algorithm-AhoCorasick-XS

1 match

t/edge_cases.t view on Meta::CPAN

    my $matcher = Algorithm::AhoCorasick::XS->new(["aa", "aa"]);
    is_deeply( [ $matcher->matches("aa") ], ["aa", "aa"], 'one result for each dupe' );
    is_deeply( [ $matcher->matches("aaa") ], ["aa", "aa", "aa", "aa"] );
};

subtest accidentally_sent_list => sub {
    eval {
        my $matcher = Algorithm::AhoCorasick::XS->new("foo", "bar", "baz");
    };
    like ($@, qr/^Usage:/, 'rejects a list');
};

view all matches for this distribution

Algorithm-BaumWelch

1 match

lib/Algorithm/BaumWelch.pm view on Meta::CPAN

necessary servicing, repair, or correction.

In no event unless required by applicable law or agreed to in writing
will any copyright holder, or any other party who may modify and/or
redistribute the software as permitted by the above licence, be
liable to you for damages, including any general, special, incidental,
or consequential damages arising out of the use or inability to use
the software (including but not limited to loss of data or data being
rendered inaccurate or losses sustained by you or third parties or a
failure of the software to operate with any other software), even if
such holder or other party has been advised of the possibility of

view all matches for this distribution

Algorithm-Bayesian

1 match

that should be provided before the module is installed.

A README file is required for CPAN modules since CPAN extracts the README
file from a module distribution so that people browsing the archive
can use it to get an idea of the module's uses. It is usually a good idea
to provide version information here so that people can decide whether
fixes for the module are worth downloading.


INSTALLATION

view all matches for this distribution

Algorithm-BellmanFord

1 match


A README file is required for CPAN modules since CPAN extracts the
README file from a module distribution so that people browsing the
archive can use it get an idea of the modules uses. It is usually a
good idea to provide version information here so that people can
decide whether fixes for the module are worth downloading.

INSTALLATION

To install this module type the following:

view all matches for this distribution

Algorithm-BestChoice

1 match

use strict 'vars';

use vars qw{$VERSION $MAIN};
BEGIN {
	# All Module::Install core packages now require synchronised versions.
	# This will be used to ensure we don't accidentally load old or
	# different versions of modules.
	# This is not enforced yet, but will be some time in the next few
	# releases once we can make sure it won't clash with custom
	# Module::Install extensions.
	$VERSION = '0.87';

view all matches for this distribution

Algorithm-BreakOverlappingRectangles

1 match


A README file is required for CPAN modules since CPAN extracts the
README file from a module distribution so that people browsing the
archive can use it get an idea of the modules uses. It is usually a
good idea to provide version information here so that people can
decide whether fixes for the module are worth downloading.

INSTALLATION

To install this module type the following:

view all matches for this distribution

Algorithm-C3

1 match

Changes view on Meta::CPAN

0.05 Fri. Aug. 25, 2006
    - Add the ability for the caller to supply a persistent
      merge cache hashref

0.04 Wed. Aug. 09, 2006
    - Remove accidental "use Class::C3" from t/006_complex_merge.t
      (no functional changes from 0.03)

0.03 Tue. Aug. 08, 2006
    - New test + bugfix for RT#20879

view all matches for this distribution

Algorithm-CRF

1 match

Halls NNP B
cough NN I
tablets NNS I
, , O
Rolaids NNP B
antacid NN I
, , O
and CC O
Lubriderm NNP B
skin NN I
lotion NN I

. . O

Higher JJR B
sales NNS I
of IN O
pesticides NNS B
and CC O
other JJ B
plant-science NN I
products NNS I
more JJR O

he PRP B
says VBZ O
. . O

An DT B
incident NN I
in IN O
1984 CD B
suggested VBD O
one CD B
additional JJ I

, , O
also RB O
shows VBZ O
that IN O
the DT B
incidence NN I
of IN O
lung NN B
cancer NN I
as RB O
well RB O

were VBD O
the DT B
inconclusive JJ I
effects NNS I
of IN O
acid NN B
rain NN I
, , O
greenhouse NN B
warming NN I
and CC O

. . O

If IN O
the DT B
media NNS I
decide VBP O
to TO O
work VB O
harder JJR O
at IN O
educating VBG O

collapse VB O
. . O

Eastern NNP B
ultimately RB O
decided VBD O
it PRP B
would MD O
have VB O
to TO O
keep VB O

bikers NNS I
were VBD O
blamed VBN O
for IN O
an DT B
accident NN I
in IN O
the DT B
Napa NNP I
County NNP I
park NN I

years NNS I
ago RB O
, , O
the DT B
district NN I
decided VBD O
to TO O
limit VB O
the DT B
bikes NNS I
to TO O

view all matches for this distribution

Algorithm-Classifier-IsolationForest

3 results

benchmarking/bench-voting.pl view on Meta::CPAN

# the trees fixed (same seed + data) and varies only the aggregation.
#
# Two things are measured:
#
#   1. SPEED.  predict() is where majority voting can win: it stops
#      walking a point's trees as soon as the majority outcome is decided
#      (the paper's "stop at majority"), whereas mean aggregation always
#      walks every tree.  score_samples() has no such early exit (the
#      vote fraction needs the full count), so it is shown as a contrast.
#      Timed across n_trees, query-set size, and feature count, under the
#      default backend (C + OpenMP when available).

view all matches for this distribution

Algorithm-Closest-NetworkAddress

1 match

use strict 'vars';

use vars qw{$VERSION};
BEGIN {
    # All Module::Install core packages now require synchronised versions.
    # This will be used to ensure we don't accidentally load old or
    # different versions of modules.
    # This is not enforced yet, but will be some time in the next few
    # releases once we can make sure it won't clash with custom
    # Module::Install extensions.
    $VERSION = '0.64';

view all matches for this distribution

Algorithm-Cluster

2 results

perl/Record.pm view on Meta::CPAN

    my @sortedindex;
    my $cluster = 0;
    while (scalar @sortedindex < $n) {
        foreach (@result) {
            my $j = $_;
            my $cid = $clusterids[$j];
            if ($clusterids[$j]==$cluster) {
                print OUTPUT $names[$j] . "\t$cluster\n";
                push (@sortedindex, $j);
            }
        }

view all matches for this distribution

Algorithm-Combinatorics

1 match

Combinatorics.pm view on Meta::CPAN

    __check_params($data, 0);

    return __contextualize(__once_iter()) if @$data == 0;

    my @a = 0..(@$data-1);
    my @c = (0) x (@$data+1); # yeah, there's an spurious $c[0] to make the notation coincide
    my $iter = Algorithm::Combinatorics::Iterator->new(sub {
        __next_permutation_heap(\@a, \@c) == -1 ? undef : [ @{$data}[@a] ];
    }, [ @{$data}[@a] ]);

    return __contextualize($iter);

view all matches for this distribution

Algorithm-ConsistentHash-Ketama

1 match

use File::Path ();

use vars qw{$VERSION $MAIN};
BEGIN {
	# All Module::Install core packages now require synchronised versions.
	# This will be used to ensure we don't accidentally load old or
	# different versions of modules.
	# This is not enforced yet, but will be some time in the next few
	# releases once we can make sure it won't clash with custom
	# Module::Install extensions.
	$VERSION = '1.08';

view all matches for this distribution

Algorithm-DecisionTree

2 results

lib/Algorithm/DecisionTree.pm view on Meta::CPAN

  return_on_equity          (R_on_E)

  market_share              (MS)

Since you are the boss, you keep track of the buy/sell decisions made by the
individual traders.  But one unfortunate day, all of your traders decide to quit
because you did not pay them enough.  So what do you do?  If you had a module like
the one here, you could still run your company and do so in such a way that, on the
average, would do better than any of the individual traders who worked for your
company.  This is what you do: You pool together the individual trader buy/sell
decisions you have accumulated during the last one year.  This pooled information is

lib/Algorithm/DecisionTree.pm view on Meta::CPAN

    jacobian_choice

The first of these parameters, C<dependent_variable>, is set to the column index in
the CSV file for the dependent variable.  The second constructor parameter,
C<predictor_columns>, tells the system as to which columns contain values for the
predictor variables.  The third parameter, C<mse_threshold>, is for deciding when to
partition the data at a node into two child nodes as a regression tree is being
constructed.  If the minmax of MSE (Mean Squared Error) that can be achieved by
partitioning any of the features at a node is smaller than C<mse_threshold>, that
node becomes a leaf node of the regression tree.

view all matches for this distribution

Algorithm-Dependency-MapReduce

2 results

use strict 'vars';

use vars qw{$VERSION $MAIN};
BEGIN {
	# All Module::Install core packages now require synchronised versions.
	# This will be used to ensure we don't accidentally load old or
	# different versions of modules.
	# This is not enforced yet, but will be some time in the next few
	# releases once we can make sure it won't clash with custom
	# Module::Install extensions.
	$VERSION = '0.83';

view all matches for this distribution

Algorithm-Dependency-Source-DBI

2 results

use strict 'vars';

use vars qw{$VERSION $MAIN};
BEGIN {
	# All Module::Install core packages now require synchronised versions.
	# This will be used to ensure we don't accidentally load old or
	# different versions of modules.
	# This is not enforced yet, but will be some time in the next few
	# releases once we can make sure it won't clash with custom
	# Module::Install extensions.
	$VERSION = '0.91';

view all matches for this distribution

Algorithm-DependencySolver

2 results

lib/Algorithm/DependencySolver/Solver.pm view on Meta::CPAN

can, of course, detect such occurrences; however, I choose not to,
because it's not clear to me what the most elegant result should be in
these situations. Semantically, it does not matter whether the edge
from C<$n> to the C<$a,$b>-cycle is from C<$n> to C<$a>, or C<$n> to
C<$b>. Which should it be? Both, or one-or-the-other (presumably
decided arbitrarily)?

Properties:

* This method can be safely called on cyclic graphs (i.e., it will not
  enter a non-terminating loop)

view all matches for this distribution

Algorithm-Diff-Any

3 results

lib/Algorithm/Diff/Any.pm view on Meta::CPAN

"AS IS" and ANY EXPRESS OR IMPLIED WARRANTIES, including, but not
limited to, the IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED.

In no event shall the copyright owner or contributors be liable for
any direct, indirect, incidental, special, exemplary or consequential
damages (including, but not limited to, procurement of substitute
goods or services; loss of use, data or profits; or business
interruption) however caused and on any theory of liability, whether
in contract, strict liability or tort (including negligence or
otherwise) arising in any way out of the use of this software, even if

view all matches for this distribution

Algorithm-Diff-JSON

1 match

GPL2.txt view on Meta::CPAN

such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices.  Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.

This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.

view all matches for this distribution

Algorithm-Diff-XS

1 match

use strict 'vars';

use vars qw{$VERSION};
BEGIN {
    # All Module::Install core packages now require synchronised versions.
    # This will be used to ensure we don't accidentally load old or
    # different versions of modules.
    # This is not enforced yet, but will be some time in the next few
    # releases once we can make sure it won't clash with custom
    # Module::Install extensions.
    $VERSION = '0.67';

view all matches for this distribution

Algorithm-DimReduction

3 results

use strict 'vars';

use vars qw{$VERSION};
BEGIN {
    # All Module::Install core packages now require synchronised versions.
    # This will be used to ensure we don't accidentally load old or
    # different versions of modules.
    # This is not enforced yet, but will be some time in the next few
    # releases once we can make sure it won't clash with custom
    # Module::Install extensions.
    $VERSION = '0.68';

view all matches for this distribution

Algorithm-Evolutionary

2 results

lib/Algorithm/Evolutionary/Op/TreeMutation.pm view on Meta::CPAN

  return $victim;
}

=head2 mutate 

Callback routine called from apply; decides on mutation application, and
applies it. If appliable, substitutes a node by other with the same arity.
Builds a lists of nodes before, to speed up operation

=cut

view all matches for this distribution

Algorithm

1 match