Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
This paper describes a system, Mr.Web, designed to interact with users over email to create and update Web pages. Our goal is that users interact with Mr.Web as if it were a human...
In this paper we test the hypothesis Given a piece of text describing an object or concept our combined disambiguation method can disambiguate whether it is a place and ground it ...
Many transportation providers such as package delivery companies and postal service organizations face the problem of designing a transportation network in order to service their ...
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization. We focus on the parallelization phase a...