1220 search results - page 189 / 244 » Restricting grammatical complexity |
ENTCS
2006
13 years 8 months ago
2006
Model theoretic syntax is concerned with studying the descriptive complexity of grammar formalisms for natural languages by defining their derivation trees in suitable logical for...
GEOINFORMATICA
2006
13 years 8 months ago
2006
Metadata is needed to facilitate data sharing among geospatial information communities. Geographic Metadata Standards are available but tend to be general and complex in nature an...
COMBINATORICS
2007
13 years 8 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
IVC
2008
13 years 8 months ago
2008
Most illuminant estimation algorithms work with the assumption of one specific type of the light source (e.g. point light source or directional light source). This assumption brin...
JAIR
2008
13 years 8 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...