16844 search results - page 391 / 3369 » How to Design Programs |
157
click to vote
COLING
2000
15 years 8 months ago
2000
In this paper, lmrsing-as-deduction and constraint programming are brought together to outline a procedure for the speeitication of constraint-based chart parsers. Fob lowing the ...
175
click to vote
AAAI
1993
15 years 8 months ago
1993
Automating the construction of semantic grammars is a di cult and interesting problem for machine learning. This paper shows how the semantic-grammar acquisition problem can be vi...
190
click to vote
JAIR
2008
15 years 6 months ago
2008
Sentence compression holds promise for many applications ranging from summarization to subtitle generation. Our work views sentence compression as an optimization problem and uses...
198
Voted
NETWORKS
2008
15 years 6 months ago
2008
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
147
click to vote
ENTCS
2002
15 years 6 months ago
2002
The refinement calculus is a well-established theory for translating specifications to program code. Recent research has extended the calculus to handle real-time requirements and...