Demo entry 6720854



Submitted by anonymous on Mar 19, 2018 at 03:49
Language: Java. Code size: 828 Bytes.

//step1: for each posssible paritioning (possible number of bins per DBi)  
for r = 1 to L do: 
	for DBi= DB1,...DBN:
	//step2: while r is fixed per each iteration 
		2.1) choose the best distribution of k1,k2,...kL in the bins such that the maximum frequnecy in any bin is minimized ==> Greedy approach can be used here 
		2.2) superimpose the same paritionting to remaining DBi
		2.3) find temp B* (bin with maximum freq) for the given paritioning over all DBi*/
		if max_temp_B* < temp_B*: //if the current temp_B* for a given DBi is larger than max_temp_B*
	//step3: find the min of temp B* over all r (the goal here is to choose r where the value of B* is minimized) 		
		if min_B* > max_temp_B*: //if the current B* for a given parition r is less than min_B*	

This snippet took 0.00 seconds to highlight.

Back to the Entry List or Home.

Delete this entry (admin only).