Sciweavers

204 search results - page 37 / 41
» Efficient Modeling of Embedded Memories in Bounded Model Che...
Sort
View
TIT
2008
102views more  TIT 2008»
15 years 5 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
SCOPES
2004
Springer
15 years 11 months ago
Compact Procedural Implementation in DSP Software Synthesis Through Recursive Graph Decomposition
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
Ming-Yung Ko, Praveen K. Murthy, Shuvra S. Bhattac...
AI
2008
Springer
15 years 6 months ago
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
Jürg Kohlas, Nic Wilson
ESWA
2006
123views more  ESWA 2006»
15 years 5 months ago
Design of a RFID case-based resource management system for warehouse operations
In the past, the selection of resources to execute various warehouse operation services was done solely by experts. In this paper, a RFIDbased Resource Management System (RFID-RMS...
Harry K. H. Chow, King Lun Choy, W. B. Lee, K. C. ...
TACAS
2010
Springer
212views Algorithms» more  TACAS 2010»
15 years 3 months ago
Assume-Guarantee Verification for Probabilistic Systems
Abstract. We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to ver...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...