We present a corpus{based approach to word{sense disambiguation that only requires information that can be automatically extracted from untagged text. We use unsupervised techniqu...
This paper addresses the problem of exploration and mapping of an unknown environment by multiple robots. The mapping algorithm is an on-line approach to likelihood maximization t...
Reid G. Simmons, David Apfelbaum, Wolfram Burgard,...
We present a new domain for unsupervised learning: automatically customizing the computer to a specific melodic performer by merely listening to them improvise. We also describe B...
This work presents a lookahead-based exploration strategy for a model-based learning agent that enables exploration of the opponent's behavior during interaction in a multi-a...
One of the important components of a local search strategy for satisfiability testing is the variable selection heuristic, which determines the next variable to be flipped. In a...