1404 search results - page 65 / 281 » Complexity of admissible rules |
156
Voted
CSR
2007
Springer
15 years 9 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
126
Voted
STORYTELLING
2007
Springer
15 years 9 months ago
2007
Springer
We present Wide Ruled, an authoring tool for the creation of generative stories. It is based on the Universe author-goal-based model of story generation, and extends this model by ...
146
Voted
LPAR
2004
Springer
15 years 9 months ago
2004
Springer
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
135
Voted
GEOS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Often the information present in a spatial knowledge base is represented at a different level of granularity and abstraction than the query constraints. For querying onto...
147
Voted
HYBRID
1998
Springer
15 years 7 months ago
1998
Springer
We discuss properties of high order neurons in competitive learning. In such neurons, geometric shapes replace the role of classic `point' neurons in neural networks. Complex ...