Sciweavers

1920 search results - page 32 / 384
» The Complexity of the A B C Problem
Sort
View
JPDC
2008
103views more  JPDC 2008»
15 years 5 months ago
On termination detection in crash-prone distributed systems with failure detectors
We investigate the problem of detecting termination of a distributed computation in systems where processes can fail by crashing. Specifically, when the communication topology is ...
Neeraj Mittal, Felix C. Freiling, Subbarayan Venka...
ICASSP
2010
IEEE
15 years 6 months ago
MMSE based noise PSD tracking with low complexity
Most speech enhancement algorithms heavily depend on the noise power spectral density (PSD). Because this quantity is unknown in practice, estimation from the noisy data is necess...
Richard C. Hendriks, Richard Heusdens, Jesper Jens...
EOR
2006
52views more  EOR 2006»
15 years 5 months ago
The joint replenishment problem with resource restriction
There are many resource restrictions in real production/inventory systems (for example, budget, storage, transportation capacity, etc.). But unlike other research areas, there is ...
I. K. Moon, B. C. Cha
ICWE
2005
Springer
15 years 11 months ago
The Role of Visual Tools in a Web Application Design and Verification Framework: A Visual Notation for LTL Formulae
As the Web becomes a platform for implementing complex B2C and B2B applications, there is a need to extend Web conceptual modeling to process-centric applications. In this context,...
Marco Brambilla, Alin Deutsch, Liying Sui, Victor ...
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 5 months ago
Matroid Pathwidth and Code Trellis Complexity
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
Navin Kashyap