5499 search results - page 203 / 1100 » Generalized Rewrite Theories |
172
click to vote
GG
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we give a category-based characterization of recognizability. A recognizable subset of arrows is defined via a functor into the category of relations on sets, which ...
158
click to vote
ADCM
2000
15 years 7 months ago
2000
We present a concrete method to build discrete biorthogonal systems such that the wavelet filters have any number of vanishing moments. Several algorithms are proposed to construct...
180
click to vote
COMPGEOM
2010
ACM
16 years 7 days ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
196
click to vote
AUSAI
2006
Springer
15 years 11 months ago
2006
Springer
In this paper, we generalize our formal approach to modelling PRS agents away from PRS-specific assumptions to more general theories of rationality, while not losing the concretene...
166
click to vote
ESAW
2006
Springer
15 years 10 months ago
2006
Springer
The rational agent community uses Michael Bratman's planning theory of intention as its theoretical foundation for the development of its agentoriented BDI languages. We prese...