Sciweavers

1242 search results - page 185 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
MEMOCODE
2006
IEEE
15 years 3 months ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...
BMCBI
2006
76views more  BMCBI 2006»
14 years 9 months ago
Coloring the Mu transpososome
Background: Tangle analysis has been applied successfully to study proteins which bind two segments of DNA and can knot and link circular DNA. We show how tangle analysis can be e...
Isabel K. Darcy, Jeff Chang, Nathan Druivenga, Col...
HYBRID
2010
Springer
15 years 4 months ago
Compositional analysis for linear control systems
The complexity of physical and engineering systems, both in terms of the governing physical phenomena and the number of subprocesses involved, is mirrored in ever more complex mat...
Florian Kerber, Arjan van der Schaft
CISS
2007
IEEE
15 years 4 months ago
Differential Space-Frequency Group Codes for MIMO-OFDM
— In recent years, coherent space-frequency (SF) coded multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems have attracted great attentio...
Engin Zeydan, Ufuk Tureli
DAM
2011
14 years 4 months ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire