This paper addresses the problem of binary decision diagram (BDD) minimization in the presence of don’t care sets. Specifically, given an incompletely specified function g and a fixed ordering of the variables, we propose an exact algorithm for selecting f such that f is a cover for g and the binary decision diagram for f is of minimum size. The approach described is the only known exact algori...

S/R and Promela are two concurrent programming languages used in nite state automated veriication of communication protocols. The semantics of S/R supports synchronous parallel composition, while semantics of Promela supports an interleaving parallel composition of processes. Because of the diierences in the execution model, the veriication tools available for the models written in these langua...

Difficulties arise with the generalized likelihood ratio test (GLRT) in situations where one or more of the unknown signal parameters requires an enumeration that is computationally intractable. In the transient signal detection problem, the frequency characteristics of the signal are typically unknown; therefore, even if an aggregate signal bandwidth is assumed, the estimation problem intrinsi...

We introduce an implicit generalized cylinder which is constructed from an axis and one or more profile curves. This surface is related to the sweep which is traditionally formed by an axis curve and one or more cross sections. Instead of cross sections, this definition uses profile curves to define how far the surface is from the axis. This facilitates the construction of surfaces which have c...

Implicit surfaces are often designed through the definition and addition of offset surfaces. These are typically defined using a skeleton of primitives such as points and lines. A predefined offset from the skeleton determines the surface. Implied in this commonly used technique is the computation of the distance from the skeleton. It is natural to use the Euclidean definition of distance. In t...

We propose a natural generalization of the concept of im plicit de nitions over nite structures allowing non determinism at an intermediate level of a deterministic de nition These generalized im plicit de nitions o er more expressive power than classical implicit de nitions Moreover their expressive power can be characterized over un ordered nite structures in terms of the complexity class NP ...

An existence theorem for a new class of parametric generalized mixed implicit quasi-variational inclusion problems is established in Hilbert spaces. Further, we study the behavior and sensitivity analysis of the solution set in this class of parametric variational inclusion problems.

We propose a natural generalization of the concept of implicit deenitions over nite structures, allowing non-determinism at an intermediate level of a (deterministic) deenition. These generalized implicit deenitions ooer more expressive power than classical implicit dee-nitions. Moreover, their expressive power can be characterized over un-ordered nite structures in terms of the complexity clas...

We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in wireless OFDMA scheduling. We use a variation of the greedy algorithm to produce a ( 2e−1 e−1 + )-approximation for every > 0, and then use partial enumeration to reduce the approximation ratio to e e−1 + .