Showing papers on "Bounding overwatch published in 1980"
TL;DR: In this article, the authors developed a methodology in describing the dynamic behavior of a class of fuzzy dynamic systems which possess the generic property that if the system initiated with all state variables non-negative, the state variables remain nonnegative for all future time.
4 citations
TL;DR: In this paper, a geometric bounding technique was used to yield tight upper and lower bounds to generalized moments of a broad class of random variables. But it is not computationally feasible to evaluate these moments exactly.
Abstract: Important problems exist in the field of communications theory whose solution is in the form of an expectation of a function of a random variable. Often it is not computationally feasible to evaluate these moments exactly. This paper presents a geometric bounding technique that yields tight upper and lower bounds to generalized moments of a broad class of random variables. This technique produces excellent results for these communications theory problems.
01 Jan 1980
TL;DR: In this article, three problems are considered, namely (literal) weighted satisfiability (WSAT), quadratic assignment (QA), and parity matroid (PM) problems, which imply a border line between "easy" and "hard" WSAT problems.
Abstract: Three problems are considered in this paper, namely (literal) weighted satisfiability (WSAT), quadratic assignment (QA) and parity matroid (PM) problems. These problems are linked via a set of reductions, which imply (i) a border line between "easy" and "hard" WSAT problems and (ii) the possibility of utilizing subgradient techniques for bounding optimal solutions to many "hard" problems.