@brief compute HPWL for a net

compute discrete cosine transformation, DCT II, using N-FFT or 2N-FFT yk = \sum_{n=0}^{N-1} x_n cos(pi/N*n*(k+1/2)) @param x sequence @

compute discrete cosine transformation, DCT II yk = \sum_{n=0}^{N-1} x_n cos(pi/N*n*(k+1/2))

compute 2D discrete cosine transformation, using N-FFT or 2N-FFT

compute 2D discrete cosine transformation

compute discrete sine transformation yk = \sum_{n=0}^{N-1} x_n cos(pi/N*(n+1/2)*(k+1))

compute discrete sine transformation yk = \sum_{n=0}^{N-1} x_n cos(pi/N*(n+1/2)*(k+1))

\return end iterator of data

\return the end iterator of m_vRowBeginIdx

@brief Estimate initial learning rate by moving a small step. Computed as | x_k - x_k_1 |_2 / | g_k - g_k_1 |_2. @param x_k c

manipulates internal time stamps such that the last run ends at time 0

@param pos current roughly legal position

@brief load from command line

\return the index of first non-empty row

Return Gaussian that truncates at the given number of standard deviations.

\brief set pin bounding box \param i pin id

\param i pin id \return text to be shown on pin

Find the config_id of the incumbent. The incumbent here is the configuration with the smallest loss among all runs on the maximum budget! If n

instantiates the next iteration Overwrite this to change the iterations for different optimizers Parameters ---------- iteration: int

function to return the next configuration and budget to run. This function is called from HB_master, don't call this from your script. It r

Compute permutation to generate following array 0, 2, 4, ..., 2*(N//2)-2, 2*(N//2)-1, 2*(N//2)-3, ..., 3, 1

@return height of the box

compute inverse discrete cosine-sine transformation This is equivalent to idcct(idcct(x)^T)^T

compute inverse discrete cosine-sine transformation This is equivalent to idcct(idcct(x)^T)^T

compute inverse discrete cosine-sine transformation This is equivalent to idxct(idxst(x)^T)^T

compute inverse discrete cosine-sine transformation This is equivalent to idxct(idxst(x)^T)^T

Compute inverse discrete cosine transformation, which is also the DCT III, using N-FFT or 2N-FFT yk = Re { 1/2*x0 + \sum_{n=1}^{N-1} xn exp(j*pi/(

Compute inverse discrete cosine transformation, which is also the DCT III yk = Re { 1/2*x0 + \sum_{n=1}^{N-1} xn exp(j*pi/(2N)*n*(2k+1)) } The

compute 2D inverse discrete cosine transformation, using N-FFT or 2N-FFT

compute 2D inverse discrete cosine transformation

compute inverse discrete cosine-sine transformation This is equivalent to idct(idxst(x)^T)^T

compute inverse discrete cosine-sine transformation This is equivalent to idxst(idxct(x)^T)^T

compute inverse discrete cosine-sine transformation This is equivalent to idxst(idxct(x)^T)^T

Compute inverse discrete sine transformation, which is also the DST III yk = Im { (-1)^k*x_{N-1}/2 + \sum_{n=0}^{N-2} xn exp(j*pi/(2N)*(n+1)*(2k+1

Compute inverse discrete sine transformation, which is also the DST III yk = Im { (-1)^k*x_{N-1}/2 + \sum_{n=0}^{N-2} xn exp(j*pi/(2N)*(n+1)*(2k+1

compute inverse discrete cosine transformation This is different from ordinary formulation for IDCT III yk = Re { \sum_{n=0}^{N-1} xn exp(j*pi

compute inverse discrete cosine transformation This is different from ordinary formulation for IDCT III yk = Re { \sum_{n=0}^{N-1} xn exp(j*pi

compute inverse discrete sine transformation This is different from ordinary formulation for IDCT III yk = Im { \sum_{n=0}^{N-1} xn exp(j*pi/(

compute inverse discrete sine transformation This is different from ordinary formulation for IDCT III yk = Im { \sum_{n=0}^{N-1} xn exp(j*pi/(

compute inverse discrete cosine-sine transformation This is equivalent to idxst(idct(x)^T)^T