Sciweavers

1599 search results - page 116 / 320
» Algorithms for Parity Games
Sort
View
IPPS
2007
IEEE
16 years 24 days ago
Combining Compression, Encryption and Fault-tolerant Coding for Distributed Storage
Storing data in distributed systems aims to offer higher bandwidth and scalability than storing locally. But, a couple of disadvantageous issues must be taken into account such as...
Peter Sobe, Kathrin Peter
DSN
2007
IEEE
15 years 10 months ago
Determining Fault Tolerance of XOR-Based Erasure Codes Efficiently
We propose a new fault tolerance metric for XOR-based erasure codes: the minimal erasures list (MEL). A minimal erasure is a set of erasures that leads to irrecoverable data loss ...
Jay J. Wylie, Ram Swaminathan
ASAP
2006
IEEE
147views Hardware» more  ASAP 2006»
15 years 8 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
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
15 years 7 months ago
Exploiting the path of least resistance in evolution
Hereditary Repulsion (HR) is a selection method coupled with a fitness constraint that substantially improves the performance and consistency of evolutionary algorithms. This als...
Gearoid Murphy, Conor Ryan
ATAL
2009
Springer
16 years 1 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...