Sciweavers

4539 search results - page 103 / 908
» Approaches to Compute Workflow Complexity
Sort
View
DAC
1994
ACM
15 years 2 months ago
A Modular Partitioning Approach for Asynchronous Circuit Synthesis
Asynchronous circuits are crucial in designing low power and high performance digital systems. In this paper, we present an ecient modular partitioning approach for asynchronous c...
Ruchir Puri, Jun Gu
GLOBECOM
2006
IEEE
15 years 4 months ago
Scalable Design of Space-Time Trellis Code with Low Decoding Complexity
—Design of space-time codes that scale with the number of transmit antennas is a difficult problem. In this paper, we introduce a new family of space-time trellis codes (STTC) th...
Kyungmin Kim, Hamid R. Sadjadpour, Rick S. Blum, Y...
IJON
2008
152views more  IJON 2008»
14 years 8 months ago
Topos: Spiking neural networks for temporal pattern recognition in complex real sounds
This article depicts the approach used to build the Topos application, a simulation of two-wheel robots able to discern real complex sounds. Topos is framed in the nouvelle concep...
Pablo González-Nalda, Blanca Cases
MAAMAW
1993
Springer
15 years 2 months ago
Coalition Formation Among Autonomous Agents: Strategies and Complexity
Autonomous agents are designed to reach goals that were pre-de ned by their operators. An important way to execute tasks and to maximize payo is to share resources and to cooperate...
Onn Shehory, Sarit Kraus
RECOMB
2006
Springer
15 years 10 months ago
A Study of Accessible Motifs and RNA Folding Complexity
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
Ydo Wexler, Chaya Ben-Zaken Zilberstein, Michal Zi...