7106 search results - page 179 / 1422 » Restricted Complexity, General Complexity |
102
Voted
WIA
1997
Springer
15 years 7 months ago
1997
Springer
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing al...
144
Voted
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
Time is a crucial variable in planning and often requires special attention since it introduces a specific structure along with additional complexity, especially in the case of dec...
133
Voted
EMISA
2005
Springer
15 years 9 months ago
2005
Springer
: XML is an effective universal data-interchange format, and XML Schema has become the preeminent mechanism for describing valid XML document structures. Generalization/specializat...
123
Voted
ICPP
1995
IEEE
15 years 7 months ago
1995
IEEE
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
120
click to vote
TAPD
1998
15 years 5 months ago
1998
We present a bottom-up parsing algorithm for stochastic context-free grammars that is able (1) to deal with multiple interpretations of sentences containing compoundwords; (2) to ...