We describe a formalism and algorithms for game-tree search in partially-observable Euclidean space, and implementation and tests in a scenario where a multi-agent team, called tr...
Eric Raboin, Dana S. Nau, Ugur Kuter, Satyandra K....
In this paper, we consider the edge searching and node searching problems on trees. Given a tree, we show a transformation from an optimal node-search strategy to an optimal edge-...
—This paper compares the performance of several structured optimization strategies in adaptive signal processing problems that are characterized by ill-conditioned error surfaces...
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
Laura Barbulescu, L. Darrell Whitley, Adele E. How...
Abstract. Automatic plagiarism detection considering a reference corpus compares a suspicious text to a set of original documents in order to relate the plagiarised fragments to th...