This paper highlights a project performed by TASC for Armstrong Laboratories, Wright-Patterson AFB. This project describes a simulation tool to help wing-level planners at an Air ...
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the discretization process is an important problem. This pa...
Identifying the regularities underlying speaker decisions to emphasize or de-emphasize an item intonationally has long been the subject of speculation and controversy. This paper ...
—In this paper, we present a near ML-achieving sphere search technique that reduces the number of search operations significantly over existing sphere decoding (SD) algorithms. ...