Examples of Optimizer

cc.mallet.optimize.Optimizer
client.net.sf.saxon.ce.expr.Optimizer
This class performs optimizations that vary between different versions of the Saxon product. The optimizer is obtained from the Saxon Configuration. This class is the version used in Saxon-B, which in most cases does no optimization at all: the methods are provided so that they can be overridden in Saxon-EE.
com.barrybecker4.optimization.Optimizer
This class (the optimizer) uses a specified optimization strategy to optimize something (the optimizee). @see OptimizationStrategyType for a list of the possible algorithms.This class uses the delegation design pattern rather than inheritance so that it can be reused across many classes. For example, I could have added an optimize method into the game/TwoPlayerController class, and all the subclasses of TwoPlayerController would be able to use it. However, by having the optimization classes in their own package, they can be used by a variety of projects to do optimization. Also it abstracts the concept of optimization and as a result makes it easy to work on independently. For example, I use this package to optimize the motion of the snake in com.barrybecker4.snake and the trebuchet simulation. This class also acts as a facade to the optimization package. The use of this package really does not need to direclty construct or use the different optimization strategy classes. Details of the optimization algorithms can be found in How To Solve It: Modern Heuristics by Michaelwics and Fogel Optimization is nearly the same thing as search. In the redpuzzle package, I use optimization to search for a solution using the genetic algorithm strategy. @author Barry Becker
com.voltvoodoo.brew.Optimizer
de.mpi.rgblab.optimizer.Optimizer
gannuOP.algorithms.Optimizer
Generic template for an optimizer. @author Francisco Viveros-Jiménez
net.rubyeye.xmemcached.impl.Optimizer
Memcached command optimizer,merge single-get comands to multi-get command,merge ByteBuffers to fit the socket's sendBufferSize etc. @author dennis
net.sf.saxon.expr.Optimizer
This class performs optimizations that vary between different versions of the Saxon product. The optimizer is obtained from the Saxon Configuration. This class is the version used in Saxon-B, which in most cases does no optimization at all: the methods are provided so that they can be overridden in Saxon-EE.
org.apache.derby.iapi.sql.compile.Optimizer
Optimizer provides services for optimizing a query. RESOLVE: o Need to figure out what to do about subqueries, figuring out their attachment points and how to communicate them back to the caller.
org.apache.hadoop.hive.ql.optimizer.Optimizer
Implementation of the optimizer
org.apache.mahout.cf.taste.impl.recommender.knn.Optimizer
org.apache.pig.impl.logicalLayer.optimizer.Optimizer
{@link Optimizer} is a simple {@link LogicalPlan} optimizer.It visits every node in the LogicalPlan and then optimizes the LogicalPlan.
org.exist.xquery.Optimizer
Analyzes the query and marks optimizable expressions for the query engine. This class just searches for potentially optimizable expressions in the query tree and encloses those expressions with an (#exist:optimize#) pragma. The real optimization work is not done by this class but by the pragma (see {@link org.exist.xquery.pragmas.Optimize}). The pragma may also decide that the optimization is not applicable and just execute the expression without any optimization. Currently, the optimizer is disabled by default. To enable it, set attribute enable-query-rewriting to yes in conf.xml: <xquery enable-java-binding="no" enable-query-rewriting="yes">... To enable/disable the optimizer for a single query, use an option:
```
declare option exist:optimize "enable=yes|no";
```
org.hibernate.id.enhanced.Optimizer
Performs optimization on an optimizable identifier generator. Typically this optimization takes the form of trying to ensure we do not have to hit the database on each and every request to get an identifier value.
Optimizers work on constructor injection. They should provide a constructor with the following arguments
1. java.lang.Class - The return type for the generated values
2. int - The increment size
@author Steve Ebersole
org.jamesii.core.experiments.optimization.Optimizer
Base class for all optimisation algorithms. Describes the base functionality of an optimisation algorithm, concerning the main loop: 1. Get responses 2. Check constraints 3. Do replications 4. check cancel criteria 5. set next configuration. This is a sequential optimiser. See {@link ParallelOptimizer} for a parallelversion. Provides a data interface to store and get results. @author Arvid Schwecke @author Roland Ewald @author Peter Sievert @author Jan Himmelspach
org.jboss.dna.graph.query.optimize.Optimizer
Interface for an optimizer.
org.modeshape.jcr.query.optimize.Optimizer
Interface for an optimizer.
org.pdf4j.saxon.expr.Optimizer
This class performs optimizations that vary between different versions of the Saxon product. The optimizer is obtained from the Saxon Configuration. This class is the version used in Saxon-B, which in most cases does no optimization at all: the methods are provided so that they can be overridden in Saxon-SA.
proguard.optimize.Optimizer
This class optimizes class pools according to a given configuration. @author Eric Lafortune
sql.optimizers.Optimizer

Examples of cc.mallet.optimize.Optimizer

                        InstanceList testSet,
                        ACRFEvaluator eval,
                        int numIter,
                        Optimizable.ByGradientValue macrf)
  {
    Optimizer maximizer = createMaxer (macrf);
//    Maximizer.ByGradient maximizer = new BoldDriver ();
//    Maximizer.ByGradient maximizer = new GradientDescent ();
    boolean converged = false;
    boolean resetOnError = true;
    long stime = System.currentTimeMillis ();


    int numNodes = (macrf instanceof ACRF.MaximizableACRF) ? ((ACRF.MaximizableACRF) macrf).getTotalNodes () : 0;
    double thresh = 1e-5 * numNodes; // "early" stopping (reasonably conservative)


    if (testSet == null) {
      logger.warning ("ACRF trainer: No test set provided.");
    }


    double prevValue = Double.NEGATIVE_INFINITY;
    double currentValue;
    int iter;
    for (iter = 0; iter < numIter; iter++) {
      long etime = new java.util.Date ().getTime ();
      logger.info ("ACRF trainer iteration " + iter + " at time " + (etime - stime));


      try {
        converged = maximizer.optimize (1);
        converged |= callEvaluator (acrf, trainingList, validationList, testSet, iter, eval);


        if (converged) break;
        resetOnError = true;

View Full Code Here

Examples of cc.mallet.optimize.Optimizer

    */


    omemm = new MEMMOptimizableByLabelLikelihood (memm, training);
    // Gather the constraints
    omemm.gatherExpectationsOrConstraints (true);
    Optimizer maximizer = new LimitedMemoryBFGS(omemm);
    int i;
//    boolean continueTraining = true;
    boolean converged = false;
    logger.info ("CRF about to train with "+numIterations+" iterations");
    for (i = 0; i < numIterations; i++) {
      try {
        converged = maximizer.optimize (1);
        logger.info ("CRF finished one iteration of maximizer, i="+i);
        runEvaluators();
      } catch (IllegalArgumentException e) {
        e.printStackTrace();
        logger.info ("Catching exception; saying converged.");

View Full Code Here

Examples of cc.mallet.optimize.Optimizer

  public MaxEnt train (InstanceList trainingSet)
  {
    logger.fine ("trainingSet.size() = "+trainingSet.size());
    RankMaxEntTrainer.MaximizableTrainer mt =
      new RankMaxEntTrainer.MaximizableTrainer (trainingSet, (RankMaxEnt)initialClassifier);
    Optimizer maximizer = new LimitedMemoryBFGS(mt);


  //  maximizer.optimize (); // XXX given the loop below, this seems wrong.
     boolean converged;


     for (int i = 0; i < numIterations; i++) {
      try {
        converged = maximizer.optimize (1);
      } catch (IllegalArgumentException e) {
        e.printStackTrace();
        logger.info ("Catching exception; saying converged.");
        converged = true;
      }

View Full Code Here

Examples of cc.mallet.optimize.Optimizer


  public MCMaxEnt train (InstanceList trainingSet)
  {
    logger.fine ("trainingSet.size() = "+trainingSet.size());
    mt = new MaximizableTrainer (trainingSet, (MCMaxEnt)initialClassifier);
    Optimizer maximizer = new LimitedMemoryBFGS(mt);
    // CPAL - change the tolerance for large vocab experiments
    ((LimitedMemoryBFGS)maximizer).setTolerance(.00001);    // std is .0001;
    maximizer.optimize (); // XXX given the loop below, this seems wrong.


    logger.info("MCMaxEnt ngetValueCalls:"+getValueCalls()+"\nMCMaxEnt ngetValueGradientCalls:"+getValueGradientCalls());
//    boolean converged;
//
//     for (int i = 0; i < numIterations; i++) {

View Full Code Here

Examples of client.net.sf.saxon.ce.expr.Optimizer

     * Static analysis: prevent sorting of the argument
     */


    public void checkArguments(ExpressionVisitor visitor) throws XPathException {
        super.checkArguments(visitor);
        Optimizer opt = visitor.getConfiguration().getOptimizer();
        argument[0] = ExpressionTool.unsorted(opt, argument[0], true);
        // we don't care about the order of the results, but we do care about how many nodes there are
    }

View Full Code Here

Examples of client.net.sf.saxon.ce.expr.Optimizer

     * @return the optimizer used in this configuration
     */


    public Optimizer getOptimizer() {
        if (optimizer == null) {
            optimizer = new Optimizer(this);
            optimizer.setOptimizationLevel(optimizationLevel);
        }
        return optimizer;
    }

View Full Code Here

Examples of com.barrybecker4.optimization.Optimizer


        ParameterArray initialGuess = new TantrixPath(board);
        assert(initialGuess.size() > 0) : "The random path should have some tiles!";
        long startTime = System.currentTimeMillis();


        Optimizer optimizer = new Optimizer(this);
        optimizer.setListener(this);


        ParameterArray solution =
            optimizer.doOptimization(strategy, initialGuess, SOLVED_THRESH);


        solution_ =
            new TantrixBoard(((TantrixPath)solution).getTilePlacements(), board.getPrimaryColor());


        TilePlacementList moves;

View Full Code Here

Examples of com.voltvoodoo.brew.Optimizer

            {
                coffeeScriptOptions.add( CoffeeScriptOption.BARE );
            }
            
            hamlCompiler = new HamlCompiler(force);
            moduleConverter = new Optimizer();
            coffeeCompiler = new CoffeeScriptCompiler(coffeeScriptOptions,force);


            for ( String relativePath : getCoffeeScriptsRelativePaths() )
            {
                try

View Full Code Here

Examples of de.mpi.rgblab.optimizer.Optimizer

  // }


  public void optimize(int distance, int surroundAngle) {
    int radiusView =  VisUtil.getViewRadius(distance);
    int radiusSurround =  VisUtil.getRadius(distance, surroundAngle);
    Optimizer opt = new Optimizer();
    classColors = opt.optimize(data, classColors, radiusSurround, radiusView);
    update(-1);
  }

View Full Code Here

Examples of de.mpi.rgblab.optimizer.Optimizer

    
    
//    data.computeSaliency(radius, classColors);
//    data.computeVisibility(radius);
//    data.export(args[2]);
    Optimizer opt = new Optimizer(logFile); //, 0.60, 6);
    classColors = opt.optimize(data, classColors, radiusView, radiusSurround);
    LogUtil l = new LogUtil(outputFile, true);
    
    for (int i =0; i< classColors.size(); i++) {
      l.log(Integer.toString(Math.round((float)classColors.get(i).getDimension_1())));
      l.log(",");

View Full Code Here

0 1 2 3 4 5 6

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.