In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Abstract. The Symposium on Computational Discovery of Communicable Knowledge was held from March 24 to 25, 2001, at Stanford University. Fifteen speakers reviewed recent advances i...
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
We describe an approach to distributed knowledge acquisition using an ontology. The ontology is used to represent and reason about soldier performance. These methods are embedded ...