5606 search results - page 924 / 1122 » Randomization Techniques for Graphs. |
168
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The problem of designing symmetric key cryptography algorithms based upon cellular automata (CAs) is considered. The reliability of the Vernam cipher used in the process ...
178
click to vote
HIPC
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
150
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
Deterministic observation and random excitation of fault sites during the ATPG process dramatically reduces the overall defective part level. However, multiple observations of eac...
163
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
191
click to vote
ICNP
2002
IEEE
15 years 11 months ago
2002
IEEE
We present the hybrid activation multiple access (HAMA) protocol for ad hoc networks. Unlike previous channel access scheduling protocols that activate either nodes or links only,...