Sciweavers

573 search results - page 94 / 115
» Sentence generation as a planning problem
Sort
View
JMLR
2010
149views more  JMLR 2010»
13 years 4 months ago
Coherent Inference on Optimal Play in Game Trees
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, ...
Philipp Hennig, David H. Stern, Thore Graepel
CHI
2003
ACM
14 years 10 months ago
Mr.Web: an automated interactive webmaster
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...
Andrea Lockerd, Huy Pham, Taly Sharon, Ted Selker
GIR
2006
ACM
14 years 3 months ago
Identifying and grounding descriptions of places
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 ...
Simon E. Overell, Stefan M. Rüger
HICSS
1999
IEEE
93views Biometrics» more  HICSS 1999»
14 years 2 months ago
The Design of a Letter-Mail Transportation Network by Intelligent Techniques
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 ...
Hans-Jürgen Sebastian, Tore Grünert, Mic...
VLDB
1994
ACM
153views Database» more  VLDB 1994»
14 years 1 months ago
Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism
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...
Waqar Hasan, Rajeev Motwani