Sciweavers

800 search results - page 81 / 160
» On the Complexity of Parity Games
Sort
View
ASAP
2006
IEEE
147views Hardware» more  ASAP 2006»
13 years 11 months ago
Reconfigurable Shuffle Network Design in LDPC Decoders
Several semi-parallel decoding architectures have been explored by researchers for the quasi-cyclic low density parity check (LDPC) codes. In these architectures, the reconfigurab...
Jun Tang, Tejas Bhatt, Vishwas Sundaramurthy
CORR
2010
Springer
67views Education» more  CORR 2010»
13 years 6 months ago
Secret Sharing LDPC Codes for the Constrained Gaussian Wiretap Channel
The problem of secret sharing over the Gaussian wiretap channel is considered. A source and a destination intend to share secret information over a Gaussian channel in the presenc...
Chan Wong Wong, Tan F. Wong, John M. Shea
CORR
2010
Springer
158views Education» more  CORR 2010»
13 years 4 months ago
Efficient Approaches for Designing Fault Tolerant Reversible Carry Look-Ahead and Carry-Skip Adders
Combinational or Classical logic circuits dissipate heat for every bit of information that is lost. Information is lost when the input vector cannot be recovered from its correspon...
Md. Saiful Islam 0003, Muhammad Mahbubur Rahman, Z...
ATVA
2007
Springer
101views Hardware» more  ATVA 2007»
14 years 3 months ago
A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies
Abstract. The emerging technology of interacting systems calls for new forto ensure their reliability. Concurrent games are paradigmatic abstract models for which several logics ha...
Sophie Pinchinat
SIGECOM
2005
ACM
153views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Marginal contribution nets: a compact representation scheme for coalitional games
We present a new approach to representing coalitional games based on rules that describe the marginal contributions of the agents. This representation scheme captures characterist...
Samuel Ieong, Yoav Shoham