This paper studies the problem of e ciently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of sche...
Planning in large, partially observable domains is challenging, especially when a long-horizon lookahead is necessary to obtain a good policy. Traditional POMDP planners that plan...
Abstract. We consider a linear system, such as an estimator or a controller, in which several signals are transmitted over wireless communication channels. With the coding and medi...
Lin Xiao, Mikael Johansson, Haitham A. Hindi, Step...
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
Learning application-specific distance metrics from labeled data is critical for both statistical classification and information retrieval. Most of the earlier work in this area h...