377 search results - page 26 / 76 » Constrained Codes as Networks of Relations |
DDECS
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—In Network-on-Chip (NoC) application design, coreto-node mapping is an important but intractable optimization problem. In the paper, we use simulated annealing to tackle...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
—We propose a reduced-complexity genetic algorithm for dynamic deployment of resource constrained multi-hop mobile sensor networks. The goal of this paper is to achieve optimal c...
DSN
2005
IEEE
14 years 1 months ago
2005
IEEE
A Cyclic Redundancy Code (CRC), when used properly, can be an effective and relatively inexpensive method to detect data corruption across communication channels. However, some sy...
STOC
1994
ACM
13 years 11 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
SAC
2009
ACM
14 years 2 months ago
2009
ACM
Parallel architectures are the way of the future, but are notoriously difficult to program. In addition to the low-level constructs they often present (e.g., locks, DMA, and non-...