2157 search results - page 198 / 432 » Binary ant algorithm |
157
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the...
158
click to vote
DCC
2002
IEEE
16 years 6 months ago
2002
IEEE
With the emergence of software delivery platforms such as Microsoft's .NET, code compression has become one of the core enabling technologies strongly affecting system perfor...
173
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
205
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We present a method of distributed model checking of multiagent systems specified by a branching-time temporal-epistemic logic. We introduce a serial algorithm, central to the dis...
152
click to vote
IJBC
2007
15 years 6 months ago
2007
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...