A key problem in reinforcement learning is finding a good balance between the need to explore the environment and the need to gain rewards by exploiting existing knowledge. Much ...
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
Abstract Practical description logic systems play an ever-growing role for knowledge representation and reasoning research even in distributed environments. In particular, the onto...
This paper motivates a comprehensive methodological framework for dealing with some aspects of real-world complexity in information system analysis and design. By complex applicat...
We have been examining mixed-initiative planning systems in the context of command and control or logistical overview situations. In such environments, the human and the computer ...
George Ferguson, James F. Allen, Bradford W. Mille...