Sciweavers

1258 search results - page 100 / 252
» Architecture-driven Problem Decomposition
Sort
View
FSTTCS
2007
Springer
14 years 3 months ago
Better Algorithms and Bounds for Directed Maximum Leaf Problems
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 ...
CDC
2009
IEEE
211views Control Systems» more  CDC 2009»
14 years 1 months ago
An event-triggered distributed primal-dual algorithm for Network Utility maximization
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...
Pu Wan, Michael D. Lemmon
SBACPAD
2003
IEEE
106views Hardware» more  SBACPAD 2003»
14 years 2 months ago
A Parallel Implementation of the LTSn Method for a Radiative Transfer Problem
— 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...
SIAMAM
2011
13 years 4 months ago
On the Kleinman-Martin Integral Equation Method for Electromagnetic Scattering by a Dielectric Body
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...
Martin Costabel, Frédérique Le Lou&e...
SDM
2008
SIAM
133views Data Mining» more  SDM 2008»
13 years 10 months ago
A RELIEF Based Feature Extraction Algorithm
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...
Yijun Sun, Dapeng Wu