frodo2.algorithms.Convergence< V extends Addable< V >, U extends Addable< U > > Class Template Reference

An optimal solution to the problem. More...

Classes
class	TimeStamp
	Convenience class containing a timestamp and utility value. More...

Public Member Functions
	Convergence ()
	Constructor.
void	processRuns (String resultPath, String resultFile, String problemName, int sampleSize, boolean maximize)
	Combines utility evolution of different runs into one median run.

Static Public Member Functions
static void	main (String[] args)
	Main function, used to merge different runs.
static< V extends Addable< V > U extends Addable< U > long	processAssignmentHistories (HashMap< String, ArrayList< CurrentAssignment< V > > > assignmentHistories, List< ? extends UtilitySolutionSpace< V, U > > hypercubes, String experiment_number, String resultPath, U infeasibleUtil, boolean maximize, boolean time)
static< V extends Addable< V > U extends Addable< U > U	getUtility (Map< String, V > assignments, List< ? extends UtilitySolutionSpace< V, U > > hypercubes)

Detailed Description

An optimal solution to the problem.

Parameters

<V>	type used for variable values
<U>	type used for utility values

Author

Brammert Ottens

Constructor & Destructor Documentation

Convergence()

frodo2.algorithms.Convergence< V extends Addable< V >, U extends Addable< U > >.Convergence

(

)

Constructor.

Referenced by main().

Member Function Documentation

getUtility()

static< V extends Addable< V > U extends Addable< U > U frodo2.algorithms.Convergence< V extends Addable< V >, U extends Addable< U > >.getUtility ( Map< String, V > assignments, List< ? extends UtilitySolutionSpace< V, U > > hypercubes )

static

References getUtility().

Referenced by getUtility(), and processAssignmentHistories().

Here is the call graph for this function:

main()

void frodo2.algorithms.Convergence< V extends Addable< V >, U extends Addable< U > >.main ( String[] args )

static

Main function, used to merge different runs.

Author

Brammert Ottens, 3 dec 2010

Parameters

args	input arguments

References Convergence(), and processRuns().

Here is the call graph for this function:

processAssignmentHistories()

static< V extends Addable< V > U extends Addable< U > long frodo2.algorithms.Convergence< V extends Addable< V >, U extends Addable< U > >.processAssignmentHistories ( HashMap< String, ArrayList< CurrentAssignment< V > > > assignmentHistories, List< ? extends UtilitySolutionSpace< V, U > > hypercubes, String experiment_number, String resultPath, U infeasibleUtil, boolean maximize, boolean time )

static

Bug

timeWriterAll will not be closed

References frodo2.algorithms.Convergence< V extends Addable< V >, U extends Addable< U > >.TimeStamp< U extends Addable< U > >.equals(), getUtility(), and processAssignmentHistories().

Referenced by processAssignmentHistories().

Here is the call graph for this function:

processRuns()

void frodo2.algorithms.Convergence< V extends Addable< V >, U extends Addable< U > >.processRuns	(	String	resultPath,
		String	resultFile,
		String	problemName,
		int	sampleSize,
		boolean	maximize )

Combines utility evolution of different runs into one median run.

Author

Brammert Ottens, 3 dec 2010

Parameters

resultPath	the path on which the runs can be found
resultFile	the file in which the results should be written
problemName	the name of the problem
sampleSize	the sample size to be used
maximize	true when we should maximize, and false otherwise

Auxilirary variable, used to convert strings to addable integers

The result file

Bug

br will not be closed

References frodo2.solutionSpaces.AddableReal.divide(), frodo2.solutionSpaces.AddableReal.fromString(), frodo2.solutionSpaces.AddableReal.getMinInfinity(), and frodo2.solutionSpaces.AddableReal.getPlusInfinity().

Referenced by main().

Here is the call graph for this function:

---

The documentation for this class was generated from the following file:

• src/frodo2/algorithms/Convergence.java