Sciweavers

1599 search results - page 13 / 320
» Algorithms for Parity Games
Sort
View
VLSISP
2010
140views more  VLSISP 2010»
14 years 8 months ago
A Split-Decoding Message Passing Algorithm for Low Density Parity Check Decoders
A Split decoding algorithm is proposed which divides each row of the parity check matrix into two or multiple nearly-independent simplified partitions. The proposed method signific...
Tinoosh Mohsenin, Bevan M. Baas
ICC
2007
IEEE
117views Communications» more  ICC 2007»
15 years 4 months ago
A Modified Bit-Flipping Decoding Algorithm for Low-Density Parity-Check Codes
― In this paper, a modified bit-flipping decoding algorithm for low-density parity-check (LDPC) codes is proposed. Both improvement in performance and reduction in decoding delay...
Telex Magloire Nkouatchah Ngatched, Fambirai Takaw...
MFCS
2004
Springer
15 years 3 months ago
When Can You Play Positionally?
We consider infinite antagonistic games over finite graphs. We present conditions that, whenever satisfied by the payoff mapping, assure for both players positional (memoryless...
Hugo Gimbert, Wieslaw Zielonka
64
Voted
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 3 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
CIAC
2006
Springer
75views Algorithms» more  CIAC 2006»
15 years 1 months ago
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes
Katalin Friedl, Gábor Ivanyos, Miklos Santh...