|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||
java.lang.Object | +--edu.iu.pcl.absurdist.bnb.BranchAndBound
Finding an optimal permutation (one miniimizing the "mismatched relation" measure, i.e. maximizing energy) by a simple branch-and-bound method. It should produce the same result as exhaustive search, but a bit faster. misRel used internally is twice the misRel computed by Measure.evalMap.
| Constructor Summary | |
BranchAndBound(Absurdist absurdist)
|
|
| Method Summary | |
int[] |
getMap()
|
| Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
public BranchAndBound(Absurdist absurdist)
| Method Detail |
public int[] getMap()
|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||