Examples of ParhiMaximumProfitToCostRatioStrategy

ptolemy.graph.analysis.strategy.ParhiMaximumProfitToCostRatioStrategy

Maximum profit to cost ratio analyzer which uses Parhi's algorithm for iteration bound.

For details about the algorithm, please refer to:

K. Ito and K. K. Parhi. Determining the minimum iteration period of an algorithm. Journal of VLSI Signal Processing, 11(3):229-244, December 1995

@see ptolemy.graph.analysis.MaximumProfitToCostRatioAnalysis @since Ptolemy II 4.0 @Pt.ProposedRating Red (shahrooz) @Pt.AcceptedRating Red (ssb) @author Shahrooz Shahparnia @version $Id: ParhiMaximumProfitToCostRatioStrategy.java,v 1.26 2007/12/06 21:56:59 cxh Exp $

     *  @param edgeProfits The profits associated with the edges of the graph.
     *  @param edgeCosts The costs associated with the edges of the graph.
     */
    public MaximumProfitToCostRatioAnalysis(Graph graph,
            ToDoubleMapping edgeProfits, ToIntMapping edgeCosts) {
        super(new ParhiMaximumProfitToCostRatioStrategy(graph, edgeProfits,
                edgeCosts));
    }

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.

Examples of ParhiMaximumProfitToCostRatioStrategy

Examples of ptolemy.graph.analysis.strategy.ParhiMaximumProfitToCostRatioStrategy