We determine the ability of Cosmic Explorer, a proposed third-generation gravitational-wave observatory, to detect eccentric binary neutron stars and measure their eccentricity. find that for matched-filter search, template banks constructed using binaries in quasi-circular orbits are effectual star with $e_{7} \leq 0.004$ ($e_{7} 0.003$) CE1 (CE2), where $e_7$ is binary's eccentricity at frequ...

This paper presents several local search heuristics for the problem of scheduling a single machine to minimize total weighted tardiness. We introduce a new binary encoding scheme to represent solutions, together with a heuristic to decode the binary representations into actual sequences. This binary encoding scheme is compared to the usual 'natural' permutation representation for descent, simul...

The binary merging algorithm is the best general purpose merging algorithm known to date. Binary merge consists of two components: a rst component in which an array index is incremented by a number nearly equal to the ratio of the sizes of the two arrays being merged followed by a second component which is binary search. In this paper we formulate a simple algorithm called interpolation merge, ...

We study the tradeoff between inference and search in the Davis Putnam algorithm. We show that neighbour resolution, a restricted form of resolution applied during search, can be simulated by applying binary resolution before search. We compare experimentally the cost of the two different methods. Our results demonstrate that binary resolution during preprocessing is generally effective at redu...