Sciweavers

6413 search results - page 579 / 1283
» Classes of cycle bases
Sort
View
JSW
2007
112views more  JSW 2007»
15 years 7 months ago
The Challenge of Training New Architects: an Ontological and Reinforcement-Learning Methodology
— This paper describes the importance of new skilled architects in the discipline of Software and Enterprise Architecture. Architects are often idealized as super heroes with a l...
Anabel Fraga, Juan Lloréns
AUTOMATICA
2004
70views more  AUTOMATICA 2004»
15 years 7 months ago
Output feedback control of discrete linear repetitive processes
Repetitive processes are a distinct class of 2D systems (i.e. information propagation in two independent directions) of both systems theoretic and applications interest. They cann...
Bartlomiej Sulikowski, Krzysztof Galkowski, Eric R...
AML
1999
86views more  AML 1999»
15 years 7 months ago
Subrecursive functions on partial sequences
The paper studies a domain theoretical notion of primitive recursion over partial sequences in the context of Scott domains. Based on a non-monotone coding of partial sequences, t...
Karl-Heinz Niggl
BSL
1999
103views more  BSL 1999»
15 years 7 months ago
The logic of bunched implications
We consider a classical (propositional) version, CBI, of O'Hearn and Pym's logic of bunched implications (BI) from a model- and prooftheoretic perspective. We present a c...
Peter W. O'Hearn, David J. Pym
JSYML
2002
84views more  JSYML 2002»
15 years 7 months ago
Maximal Contiguous Degrees
A computably enumerable (c.e.) degree is a maximal contiguous degree if it is contiguous and no c.e. degree strictly above it is contiguous. We show that there are infinitely many ...
Peter Cholak, Rodney G. Downey, Stephen Walk