1519 search results - page 250 / 304 » The Domain Dependence of Parsing |
169
click to vote
AAAI
1998
15 years 7 months ago
1998
Scheduling of multiple parallel machinesin the face of sequence dependent setups and downstream considerations is a hard problem. No single efficient algorithm is guaranteedto pro...
158
click to vote
AAAI
1998
15 years 7 months ago
1998
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
145
click to vote
ANLP
2000
15 years 7 months ago
2000
We present three systems for surface natural language generation that are trainable from annotated corpora. The first two systems, called NLG1 and NLG2, require a corpus marked on...
146
click to vote
AAAI
1997
15 years 7 months ago
1997
The degree to which a planner succeeds and meets response deadlines depends on the correctness and completenessof its modelswhichdescribe events and actions that change the world ...
169
click to vote
NIPS
2000
15 years 7 months ago
2000
A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. As s...