4401 search results - page 642 / 881 » Computing with Default Logic |
146
click to vote
AUTOMATICA
2008
15 years 5 months ago
2008
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
129
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
A channel machine consists of a finite controller together with several fifo channels; the controller can read messages from the head of a channel and write messages to the tail of...
121
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
106
click to vote
FAC
2008
15 years 4 months ago
2008
Substitution is fundamental to the theory of logic and computation. Is substitution something that we define on syntax on a case-by-case basis, or can we turn the idea of substitut...
125
click to vote
LOBJET
2008
15 years 4 months ago
2008
Self-adapting software adapts its behavior in an autonomic way, by dynamically adding, suppressing and recomposing components, and by the use of computational reflection. One way t...