Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
This paper describes a novel intellectual structure for the subject space of material designed for selective autodidactic learning in a large knowledge base. This structure is base...
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. As a generalization of ...
Inconsistencies frequently occur in knowledge about the real-world. Some of these inconsistencies may be more significant than others, and some knowledgebases (sets of formulae) m...
We have for several years been working on an approach to knowledge system building that argues for the existence of a close connection between the tasks which the knowledge system ...