Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
Let n be the fraction of structures of size" n which are connected"; e.g., a the fraction of labeled or unlabeled n-vertex graphshavingone component, b the fraction of p...
Jason P. Bell, Edward A. Bender, Peter J. Cameron,...
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
: This paper presents an experimental module for teaching finite state machine concepts. This module is designed for use in a lecture-based course that does not currently have a la...
abstract, we propose a study on joint rate-and-power allocation problem for multi-channel spectrum sharing networks (SSNs). We formulate this cross-layer optimization problem as a...