This is a preview. Log in through your library . Abstract A general procedure is presented for computing the best, 2nd best, ⋯, Kth best solutions to a given discrete optimization problem. If the ...
We consider discrete orthogonal polynomial ensembles which are discrete analogues of the orthogonal polynomial ensembles in random matrix theory. These ensembles occur in certain problems in ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback