133 std::list<LabelPosition*> * getSolution(
bool returnInactive );
140 SubPart *subPart(
int r,
int featseed,
int *isIn );
142 void initialization();
144 double compute_feature_cost(
SubPart *part,
int feat_id,
int label_id,
int *nbOverlap );
145 double compute_subsolution_cost(
SubPart *part,
int *s,
int * nbOverlap );
150 double popmusic_chain(
SubPart *part );
152 double popmusic_tabu(
SubPart *part );
159 double popmusic_tabu_chain(
SubPart *part );
164 void init_sol_empty();
165 void init_sol_falp();
174 int nbLabelledLayers;
206 double *labelPositionCost;
218 double *inactiveCost;
233 void solution_cost();
234 void check_solution();
void addCandidatePosition(LabelPosition *position)
Adds a candidate label position to the problem.
int getFeatureCandidateCount(int i)
int probSize
of features in problem
void seed(uint32_t value)
struct pal::_subpart SubPart
int * sub
wrap bw sub feat and main feat
int subSize
total # features (prob + border)
LabelPosition is a candidate feature label position.
LabelPosition * getFeatureCandidate(int fi, int ci)
int borderSize
of features bounding the problem
int seed
first feat in sub part