8838 search results - page 310 / 1768 » Generalizing Domain Theory |
198
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
169
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
We provide a time domain analysis of the robustness and stability performance for coupled adaptive algorithms of gradient type. The considered coupling may occur inherently as wel...
184
click to vote
KR
1998
Springer
15 years 11 months ago
1998
Springer
This paper presents a method for reasoning about spatial objects and their qualitative spatial relationships. In contrast to existing work, which mainly focusses on reasoning abou...
169
Voted
FCT
2007
Springer
15 years 10 months ago
2007
Springer
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...
175
click to vote
ENTCS
2008
15 years 6 months ago
2008
: A finite-time computable function is a partial function from to whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computabili...