eldorado.tu-dortmund.de/server/api/core/bitstreams/51517cae-a13e-4e61-a81f-9ef6ede6e432/content
optimal costs in the first parameter, those are the pieces ending at positions p j with j ∈ {1,4,6,8}, j ∈ {2,4,6,8}, j ∈ {1,5,7,9} or j ∈ {2,5,7,9}. Out of these possible selections, the pieces ending at positions [...] pos < P do 4: if ∀i = 1, . . . , I : ri(p)≤ αi then 5: pieceCount← pieceCount +1 6: step← l 7: else 8: step← max
i=1,...,I ri(p)−αi
9: step←max(step,1e−16) · l 10: pos← pos+step
11: return pieceCount
3 [...] for all positions p j with indices j = 1, . . . ,J do 6: if valPred[ j,s] 6= /0 then 7: if s = 1 then 8: ownCost[ j,s]← ci(p j)
9: else 10: /* Pick the piece ending at p j and its cheapest predecessors */ …