31 search results - page 3 / 7 » Reformulating Global Grammar Constraints |
DATE
2002
IEEE
13 years 10 months ago
2002
IEEE
The oscillator problem consists of determining good initial values for the node voltages and the frequency of oscillation and the avoidance of the DC solution. Standard approaches...
SIAMJO
2000
13 years 5 months ago
2000
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
ACL
2010
13 years 3 months ago
2010
For languages with (semi-) free word order (such as German), labelling grammatical functions on top of phrase-structural constituent analyses is crucial for making them interpreta...
SIAMJO
2008
13 years 5 months ago
2008
It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric ...
EACL
1989
ACL Anthology
13 years 7 months ago
1989
ACL Anthology
This paper shows how higher levels of generalization can be introduced into unification grammars by exploiting methods for typing grammatical objects. We discuss the strategy of u...