305 search results - page 13 / 61 » From Sets to Bits in Coq |
GECCO
2003
Springer
15 years 4 months ago
2003
Springer
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
MOBIHOC
2008
ACM
15 years 10 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
113
click to vote
MOBIHOC
2002
ACM
15 years 10 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
129
click to vote
CTRSA
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. Online ciphers are deterministic length-preserving permutations EK : ({0, 1}n )+ → ({0, 1}n )+ where the i-th block of ciphertext depends only on the first i blocks of...
ISMIR
2005
Springer
15 years 4 months ago
2005
Springer
An audio fingerprint is a compact yet very robust representation of the perceptually relevant parts of audio content. It can be used to identify audio, even when of severely dist...