The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
— A radiative transfer solver that implements the LTSn method was optimized and parallelized using the MPI message passing communication library. Timing and profiling informatio...
Roberto P. Souto, Haroldo F. de Campos Velho, Step...
The interface problem describing the scattering of time-harmonic electromagnetic waves by a dielectric body is often formulated as a pair of coupled boundary integral equations fo...
RELIEF is considered one of the most successful algorithms for assessing the quality of features due to its simplicity and effectiveness. It has been recently proved that RELIEF i...